Unbordered Pictures: Properties and Construction

DOI10.1007/978-3-319-23021-4_5zbMath1401.94009OpenAlexW2294506270MaRDI QIDQ2947146

Marcella Anselmo, Dora Giammarresi, Marina Madonia

Publication date: 22 September 2015

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_5

zbMATH Keywords

unbordered picturesbifix-free strings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Algorithms on strings (68W32)

Related Items (5)

Non-expandable non-overlapping sets of pictures ⋮ A 2D non-overlapping code over a \(q\)-ary alphabet ⋮ Two-dimensional comma-free and cylindric codes ⋮ Non-overlapping matrices ⋮ Sets of Pictures Avoiding Overlaps

Cites Work

• Unnamed Item
• Polyomino tilings, cellular automata and codicity
• A unifying approach to picture grammars
• A computational model for tiling recognizable two-dimensional languages
• Two-dimensional prefix string matching and covering on square matrices
• A codicity undecidable problem in the plane.
• A simple suboptimal construction of cross-bifix-free codes
• Coverability in Two Dimensions
• Strong Prefix Codes of Pictures
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• A Survey on Picture-Walking Automata
• Picture codes
• Unambiguous recognizable two-dimensional languages
• Deterministic and Unambiguous Families within 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
• Cross-Bifix-Free Codes Within a Constant Factor of Optimality
• Extended Two-Way Ordered Restarting Automata for Picture Languages

This page was built for publication: Unbordered Pictures: Properties and Construction