Abstract
In string combinatorics, the sets of strings that have no overlaps (i.e. the prefix of one string does not coincide with the suffix of another string) are extensively investigated since they play an important role in the context of string matching and coding. The notion of overlap can be extended naturally to two dimensions; two pictures p and q have an overlap if one can put one corner of p on some position in q in such a way that all symbols in the common positions coincide. A picture with no self-overlaps is called unbordered and it is a generalization in two dimensions of an unbordered (or bifix-free) string.
We study the problem of generating all unbordered pictures of fixed size and present a construction of non-expandable non-overlapping sets of pictures together with some examples.
Keywords
Partially supported by INdAM-GNCS Project 2017, FARB Project ORSA138754 of University of Salerno and FIR Project 375E90 of University of Catania.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoret. Comput. Sci. 147, 165–180 (1995)
Anselmo, M., Giammarresi, D., Madonia, M.: Deterministic and unambiguous families within recognizable two-dimensional languages. Fund. Inform. 98(2–3), 143–166 (2010)
Anselmo, M., Giammarresi, D., Madonia, M.: Strong prefix codes of pictures. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) CAI 2013. LNCS, vol. 8080, pp. 47–59. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40663-8_6
Anselmo, M., Giammarresi, D., Madonia, M.: Two dimensional prefix codes of pictures. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 46–57. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38771-5_6
Anselmo, M., Giammarresi, D., Madonia, M.: Unbordered pictures: properties and construction. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 45–57. Springer, Cham (2015). doi:10.1007/978-3-319-23021-4_5
Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous recognizable two-dimensional languages. ITA 40(2), 227–294 (2006)
Anselmo, M., Giammarresi, D., Madonia, M.: A computational model for tiling recognizable two-dimensional languages. Theor. Comput. Sci. 410(37), 3520–3529 (2009)
Anselmo, M., Giammarresi, D., Madonia, M.: Prefix picture codes: a decidable class of two-dimensional codes. Int. J. Found. Comput. Sci. 25(8), 1017–1032 (2014)
Anselmo, M., Giammarresi, D., Madonia, M.: Non-expandable non-overlapping sets of pictures. Theor. Comput. Sci. 657, 127–136 (2017)
Anselmo, M., Giammarresi, D., Madonia, M.: Picture codes and deciphering delay. Inf. Comput. 253, 358–370 (2017)
Anselmo, M., Giammarresi, D., Madonia, M.: Structure and properties of strong prefix codes of pictures. Math. Struct. Comput. Sci. 27(2), 123–142 (2017). http://journals.cambridge.org/article-S0960129515000043
Anselmo, M., Madonia, M.: Two-dimensional comma-free and cylindric codes. Theor. Comput. Sci. 658, 4–17 (2017)
Bajic, D.: On construction of cross-bifix-free kernel sets. In: 2nd MCM COST 2100, Lisbon, Portugal (2007)
Bajic, D., Loncar-Turukalo, T.: A simple suboptimal construction of cross-bifix-free codes. Crypt. Commun. 6(1), 27–37 (2014)
Barcucci, E., Bernini, A., Bilotta, S., Pinzani, R.: Cross-bifix-free sets in two dimensions. Theor. Comput. Sci. 664, 29–38 (2017)
Barcucci, E., Bernini, A., Bilotta, S., Pinzani, R.: Non-overlapping matrices. Theor. Comput. Sci. 658, 36–45 (2017)
Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theor. Comp. Sci 303, 417–430 (2003)
Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2009)
Bilotta, S., Pergola, E., Pinzani, R.: A new approach to cross-bifix-free sets. IEEE Trans. Inf. Theory 58(6), 4058–4063 (2012)
Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: SWAT (FOCS), pp. 155–160 (1967)
Bozapalidis, S., Grammatikopoulou, A.: Picture codes. ITA 40(4), 537–550 (2006)
Chee, Y.M., Kiah, H.M., Purkayastha, P., Wang, C.: Cross-bifix-free codes within a constant factor of optimality. IEEE Trans. Inf. Theory 59(7), 4668–4674 (2013)
Crochemore, M., Iliopoulos, C.S., Korda, M.: Two-dimensional prefix string matching and covering on square matrices. Algorithmica 20(4), 353–373 (1998)
Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002). http://www-igm.univ-mlv.fr/ mac/JOS/JOS.html
Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recognit. Artif. Intell. 6(2–3), 241–256 (1992)
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 215–268. Springer, Heidelberg (1997)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
Kari, J., Salo, V.: A survey on picture-walking automata. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 183–213. Springer, Heidelberg (2011). doi:10.1007/978-3-642-24897-9_9
Kolarz, M., Moczurad, W.: Multiset, set and numerically decipherable codes over directed figures. In: Arumugam, S., Smyth, W.F. (eds.) IWOCA 2012. LNCS, vol. 7643, pp. 224–235. Springer, Heidelberg (2012). doi:10.1007/978-3-642-35926-2_25
Nielsen, P.T.: A note on bifix-free sequences. IEEE Trans. Inf. Theory 19(5), 704–706 (1973)
Pradella, M., Cherubini, A., Crespi-Reghizzi, S.: A unifying approach to picture grammars. Inf. Comput. 209(9), 1246–1267 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 IFIP International Federation for Information Processing
About this paper
Cite this paper
Anselmo, M., Giammarresi, D., Madonia, M. (2017). Avoiding Overlaps in Pictures. In: Pighizzini, G., Câmpeanu, C. (eds) Descriptional Complexity of Formal Systems. DCFS 2017. Lecture Notes in Computer Science(), vol 10316. Springer, Cham. https://doi.org/10.1007/978-3-319-60252-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-60252-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60251-6
Online ISBN: 978-3-319-60252-3
eBook Packages: Computer ScienceComputer Science (R0)