Characterization and measure of infinite two-dimensional strong prefix codes

DOI10.1016/J.IC.2020.104536zbMATH Open1460.68048OpenAlexW3009199444MaRDI QIDQ2201795FDOQ2201795

Authors: Marcella Anselmo, Dora Giammarresi, Maria Madonia 

Publication date: 17 September 2020

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

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

Recommendations

• Infinite two-dimensional strong prefix codes: characterization and properties
• Structure and measure of a decidable class of two-dimensional codes
• Structure and properties of strong prefix codes of pictures
• Two dimensional prefix codes of pictures
• Strong prefix codes of pictures

zbMATH Keywords

measuretwo-dimensional languagesprefix codes

Mathematics Subject Classification ID

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

Cites Work

• Computing and Combinatorics
• Full sets of pictures to encode pictures
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• A survey on picture-walking automata
• Picture codes
• Picture codes and deciphering delay
• PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
• Two Dimensional Prefix Codes of Pictures
• A unifying approach to picture grammars
• Two-dimensional comma-free and cylindric codes
• Framed Versus Unframed Two-Dimensional Languages
• Polyomino tilings, cellular automata and codicity
• A characterization of recognizable picture languages by tilings by finite sets
• A codicity undecidable problem in the plane.
• Strong Prefix Codes of Pictures
• Unambiguous recognizable two-dimensional languages
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• Cross-bifix-free sets in two dimensions
• Structure and Measure of a Decidable Class of Two-dimensional Codes
• Structure and properties of strong prefix codes of pictures
• Deterministic ordered restarting automata for picture languages
• Infinite two-dimensional strong prefix codes: characterization and properties

Cited In (5)

• Hypercubes and isometric words based on swap and mismatch distance
• Isometric words based on swap and mismatch distance
• Infinite two-dimensional strong prefix codes: characterization and properties
• Quaternary \(n\)-cubes and isometric words
• Isometric words and edit distance: main notions and new variations

This page was built for publication: Characterization and measure of infinite two-dimensional strong prefix codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201795)