Non-expandable non-overlapping sets of pictures
From MaRDI portal
Publication:346246
DOI10.1016/j.tcs.2016.09.025zbMath1355.68298arXiv1605.09061OpenAlexW2529751054MaRDI QIDQ346246
Dora Giammarresi, Marcella Anselmo, Marina Madonia
Publication date: 5 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.09061
Related Items
Reducing local alphabet size in recognizable picture languages, Non-overlapping matrices via Dyck words, Reducing the local alphabet size in tiling systems by means of 2D comma-free codes, Sets of Pictures Avoiding Overlaps, The alphabetic complexity in homomorphic definitions of word, tree and picture languages
Cites Work
- A logical approach to locality in pictures languages
- Picture codes and deciphering delay
- A unifying approach to picture grammars
- Two-dimensional comma-free and cylindric codes
- Non-overlapping matrices
- A computational model for tiling recognizable two-dimensional languages
- Two-dimensional prefix string matching and covering on square matrices
- A simple suboptimal construction of cross-bifix-free codes
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- Unbordered Pictures: Properties and Construction
- A Survey on Picture-Walking Automata
- Picture codes
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- Algorithms on Strings, Trees and Sequences
- A note on bifix-free sequences (Corresp.)
- Jewels of Stringology
- PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
- A New Approach to Cross-Bifix-Free Sets
- Two Dimensional Prefix Codes of Pictures
- Cross-Bifix-Free Codes Within a Constant Factor of Optimality
- RESTARTING TILING AUTOMATA
