Picture codes and deciphering delay

DOI10.1016/j.ic.2016.06.003zbMath1368.68229OpenAlexW2431737286MaRDI QIDQ515672

Dora Giammarresi, Marcella Anselmo, Marina Madonia

Publication date: 16 March 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.06.003

zbMATH Keywords

deciphering delaycodestwo-dimensional languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (5)

Non-expandable non-overlapping sets of pictures ⋮ Characterization and measure of infinite two-dimensional strong prefix codes ⋮ Two-dimensional comma-free and cylindric codes ⋮ Sets of Pictures Avoiding Overlaps ⋮ Two-dimensional codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polyomino tilings, cellular automata and codicity
• Deterministic and unambiguous two-dimensional languages over one-letter alphabet
• A characterization of recognizable picture languages by tilings by finite sets
• A codicity undecidable problem in the plane.
• Strong Prefix Codes of Pictures
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• Picture codes
• Unambiguous recognizable two-dimensional languages
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• Computing and Combinatorics
• PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
• Two Dimensional Prefix Codes of Pictures
• Picture Codes with Finite Deciphering Delay
• Decidability of code properties

This page was built for publication: Picture codes and deciphering delay