%0 Conference Proceedings
%T Avoiding Overlaps in Pictures
%+ Università degli Studi di Salerno = University of Salerno (UNISA)
%+ Università degli Studi di Roma Tor Vergata [Roma] = University of Rome Tor Vergata
%+ Università degli studi di Catania = University of Catania (Unict)
%A Anselmo, Marcella
%A Giammarresi, Dora
%A Madonia, Maria
%Z Part 1: Invited Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Milano, Italy
%Y Giovanni Pighizzini
%Y Cezar Câmpeanu
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10316
%P 16-32
%8 2017-07-03
%D 2017
%R 10.1007/978-3-319-60252-3_2
%K Two-dimensional language
%K Overlap
%K Unbordered picture
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01657001/document
%2 https://inria.hal.science/hal-01657001/file/440206_1_En_2_Chapter.pdf
%L hal-01657001
%U https://inria.hal.science/hal-01657001
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10316