Avoiding Overlaps in Pictures - Descriptional Complexity of Formal Systems (DCFS 2017) Access content directly
Conference Papers Year : 2017

Avoiding Overlaps in Pictures


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.
Fichier principal
Vignette du fichier
440206_1_En_2_Chapter.pdf (117.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01657001 , version 1 (06-12-2017)





Marcella Anselmo, Dora Giammarresi, Maria Madonia. Avoiding Overlaps in Pictures. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.16-32, ⟨10.1007/978-3-319-60252-3_2⟩. ⟨hal-01657001⟩
73 View
100 Download



Gmail Facebook X LinkedIn More