Snake-Deterministic Tiling Systems
From MaRDI portal
Recommendations
- Exploring inside tiling recognizable picture languages to find deterministic subclasses
- Perfectly quilted rectangular snake tilings
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Tiling Recognizable Two-Dimensional Languages
- Deterministic recognizability of picture languages with Wang automata
Cites work
- A computational model for tiling recognizable two-dimensional languages
- A survey of two-dimensional automata theory
- Complexity of two-dimensional patterns
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Matrix-based complexity functions and recognizable picture languages
- Regional Languages and Tiling: A Unifying Approach to Picture Grammars
- Some properties of two-dimensional on-line tessellation acceptors
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
- Unambiguous recognizable two-dimensional languages
Cited in
(10)- Snakes in square, honeycomb and triangular lattices
- Snakes, Ladders, and Isolas of Localized Patterns
- Towards more expressive 2D deterministic automata
- Simple picture processing based on finite automata and regular grammars
- scientific article; zbMATH DE number 5315132 (Why is no real title available?)
- scientific article; zbMATH DE number 2086231 (Why is no real title available?)
- Perfectly quilted rectangular snake tilings
- Strategies to scan pictures with automata based on Wang tiles
- Classes of two-dimensional languages and recognizability conditions
- Two-dimensional models
This page was built for publication: Snake-Deterministic Tiling Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182954)
