Exploring inside tiling recognizable picture languages to find deterministic subclasses
From MaRDI portal
Publication:2909092
Recommendations
- A brief excursion inside the class of tiling recognizable two-dimensional languages
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Tiling Recognizable Two-Dimensional Languages
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Unambiguous recognizable two-dimensional languages
Cites work
- A computational model for tiling recognizable two-dimensional languages
- Complexity of two-dimensional patterns
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Recognizable picture languages and domino tiling
- Some properties of two-dimensional on-line tessellation acceptors
- Tile rewriting grammars and picture languages
Cited in
(9)- Snake-Deterministic Tiling Systems
- Unambiguous recognizable two-dimensional languages
- A brief excursion inside the class of tiling recognizable two-dimensional languages
- Classification of string languages via tiling recognizable picture languages
- Recognizable picture languages and domino tiling
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
- Towards more expressive 2D deterministic automata
- Framed Versus Unframed Two-Dimensional Languages
- On the Complexity of Unary Tiling-Recognizable Picture Languages
This page was built for publication: Exploring inside tiling recognizable picture languages to find deterministic subclasses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909092)
