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.
Anselmo, M., Giammarresi, D., & Madonia, M. (2017). Avoiding overlaps in pictures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp.16-32). Springer Verlag.
|Autori:||Anselmo, M; Giammarresi, D; Madonia, M|
|Titolo:||Avoiding overlaps in pictures|
|Nome del convegno:||19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017|
|Luogo del convegno:||ita|
|Anno del convegno:||2017|
|Data di pubblicazione:||2017|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-319-60252-3_2|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Tipologia:||Intervento a convegno|
|Citazione:||Anselmo, M., Giammarresi, D., & Madonia, M. (2017). Avoiding overlaps in pictures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp.16-32). Springer Verlag.|
|Appare nelle tipologie:||02 - Intervento a convegno|