PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES

DOI10.1142/S0129054114400218zbMath1309.68113MaRDI QIDQ5247172

Marcella Anselmo, Marina Madonia, Dora Giammarresi

Publication date: 23 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

maximalitycompletenessprefix codestwo-dimensional languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Non-expandable non-overlapping sets of pictures ⋮ Unbordered Pictures: Properties and Construction ⋮ Full sets of pictures to encode pictures ⋮ Two-dimensional Fibonacci words: tandem repeats and factor complexity ⋮ Characterization and measure of infinite two-dimensional strong prefix codes ⋮ Structure and properties of strong prefix codes of pictures ⋮ Picture codes and deciphering delay ⋮ Two-dimensional comma-free and cylindric codes ⋮ Sets of Pictures Avoiding Overlaps ⋮ Two-dimensional codes

Cites Work

• Polyomino tilings, cellular automata and codicity
• Complexity of two-dimensional patterns
• A characterization of recognizable picture languages by tilings by finite sets
• A codicity undecidable problem in the plane.
• Unambiguous recognizable two-dimensional languages

This page was built for publication: PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES