Avoiding overlaps in pictures
| Autor: | Marcella Anselmo, Maria Madonia, Dora Giammarresi |
|---|---|
| Přispěvatelé: | Università degli Studi di Salerno (UNISA), Università degli Studi di Roma Tor Vergata [Roma], Università degli studi di Catania [Catania], Giovanni Pighizzini, Cezar Câmpeanu, TC 1, WG 1.2 |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
Overlap
Computer science Unbordered picture 0102 computer and information sciences 02 engineering and technology String searching algorithm computer.software_genre 01 natural sciences Theoretical Computer Science Combinatorics High Energy Physics::Theory Two-dimensional language Computer Science (all) 0202 electrical engineering electronic engineering information engineering [INFO]Computer Science [cs] Settore INF/01 - Informatica business.industry Unbordered pictures 020206 networking & telecommunications Prefix 010201 computation theory & mathematics Two-dimensional language Overlap Unbordered pictures Artificial intelligence Suffix business computer Computer Science::Formal Languages and Automata Theory Natural language processing |
| Zdroj: | Lecture Notes in Computer Science 19th International Conference on Descriptional Complexity of Formal Systems (DCFS) 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⟩ Descriptional Complexity of Formal Systems ISBN: 9783319602516 DCFS |
| DOI: | 10.1007/978-3-319-60252-3_2⟩ |
| Popis: | Part 1: Invited Papers; International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|