Characterization and measure of infinite two-dimensional strong prefix codes
From MaRDI portal
Publication:2201795
Recommendations
Cites work
- A characterization of recognizable picture languages by tilings by finite sets
- A codicity undecidable problem in the plane.
- A survey on picture-walking automata
- A unifying approach to picture grammars
- Computing and Combinatorics
- Cross-bifix-free sets in two dimensions
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Deterministic ordered restarting automata for picture languages
- Framed Versus Unframed Two-Dimensional Languages
- Full sets of pictures to encode pictures
- Infinite two-dimensional strong prefix codes: characterization and properties
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- Picture codes
- Picture codes and deciphering delay
- Polyomino tilings, cellular automata and codicity
- Prefix picture codes: a decidable class of two-dimensional codes
- Strong prefix codes of pictures
- 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
- Two-dimensional comma-free and cylindric codes
- Unambiguous recognizable two-dimensional languages
Cited in
(6)- Hypercubes and isometric words based on swap and mismatch distance
- Isometric words based on swap and mismatch distance
- Structure and measure of a decidable class of two-dimensional codes
- 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)
