Two-dimensional codes
From MaRDI portal
Publication:2106615
Cites work
- A 2D non-overlapping code over a q-ary alphabet
- A characterization of recognizable picture languages by tilings by finite sets
- A codicity undecidable problem in the plane.
- A survey on picture-walking automata
- An Introduction to Symbolic Dynamics and Coding
- Asymptotic density of brick and word codes.
- Codes and automata.
- Communication complexity tools on recognizable picture languages
- Complexity of two-dimensional patterns
- Decidability of multiset, set and numerically decipherable directed figure codes
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Deterministic ordered restarting automata for picture languages
- Full sets of pictures to encode pictures
- Matrix-based complexity functions and recognizable picture languages
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Periodicity in rectangular arrays
- Picture codes
- Picture codes and deciphering delay
- Polyomino tilings, cellular automata and codicity
- Prefix picture codes: a decidable class of two-dimensional codes
- Recurrence in multidimensional words
- Simple picture processing based on finite automata and regular grammars
- Structure and properties of strong prefix codes of pictures
- Toroidal codes and conjugate pictures
- Two-dimensional comma-free and cylindric codes
- Two-dimensional palindromes and their properties
- Two-dimensional pattern matching against basic picture languages
- Unambiguous recognizable two-dimensional languages
This page was built for publication: Two-dimensional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106615)
