Two-dimensional comma-free and cylindric codes
From MaRDI portal
Publication:728259
DOI10.1016/J.TCS.2016.06.016zbMath1355.68145OpenAlexW2420792832MaRDI QIDQ728259
Marcella Anselmo, Marina Madonia
Publication date: 19 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.016
Related Items (6)
Non-expandable non-overlapping sets of pictures ⋮ Reducing the local alphabet size in tiling systems by means of 2D comma-free codes ⋮ Characterization and measure of infinite two-dimensional strong prefix codes ⋮ Homomorphic characterization of tree languages based on comma-free encoding ⋮ Sets of Pictures Avoiding Overlaps ⋮ Two-dimensional codes
Cites Work
- Unnamed Item
- Unnamed Item
- Picture codes and deciphering delay
- Polyomino tilings, cellular automata and codicity
- Restrictions and generalizations on comma-free codes
- A characterization of recognizable picture languages by tilings by finite sets
- Completing comma-free codes
- A codicity undecidable problem in the plane.
- On Fine and Wilf's theorem for bidimensional words.
- An algebraic geometric approach to Nivat's conjecture
- Coverability in Two Dimensions
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- Unbordered Pictures: Properties and Construction
- Structure and properties of strong prefix codes of pictures
- Comma-Free Codes
- Picture codes
- Unambiguous recognizable two-dimensional languages
- Framed Versus Unframed Two-Dimensional Languages
- Two-Dimensional Periodicity in Rectangular Arrays
- Computing and Combinatorics
- Finite Completion of comma-free codes Part 1
- Finite Completion of comma-free codes Part 2
- PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
- Maximal and variable word-length comma-free codes
This page was built for publication: Two-dimensional comma-free and cylindric codes
