Structure and properties of strong prefix codes of pictures

DOI10.1017/S0960129515000043zbMath1364.94495OpenAlexW2566439177MaRDI QIDQ2971057

Marcella Anselmo, Marina Madonia, Dora Giammarresi

Publication date: 4 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129515000043

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Related Items (5)

Full sets of pictures to encode 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
• 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

This page was built for publication: Structure and properties of strong prefix codes of pictures