Two-dimensional codes
From MaRDI portal
Publication:2106615
DOI10.1007/978-3-030-51466-2_27OpenAlexW3038097458MaRDI QIDQ2106615
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_27
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity in rectangular arrays
- Picture codes and deciphering delay
- Polyomino tilings, cellular automata and codicity
- Two-dimensional comma-free and cylindric codes
- Deterministic ordered restarting automata for picture languages
- Complexity of two-dimensional patterns
- A characterization of recognizable picture languages by tilings by finite sets
- A codicity undecidable problem in the plane.
- A 2D non-overlapping code over a \(q\)-ary alphabet
- Simple picture processing based on finite automata and regular grammars
- Two-dimensional pattern matching against basic picture languages
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Toroidal codes and conjugate pictures
- Recurrence in multidimensional words
- Communication complexity tools on recognizable picture languages
- Full sets of pictures to encode pictures
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- Structure and properties of strong prefix codes of pictures
- A Survey on Picture-Walking Automata
- Picture codes
- Unambiguous recognizable two-dimensional languages
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- An Introduction to Symbolic Dynamics and Coding
- PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
- Two-Dimensional Palindromes and Their Properties
This page was built for publication: Two-dimensional codes
