A brief excursion inside the class of tiling recognizable two-dimensional languages
From MaRDI portal
Recommendations
- Exploring inside tiling recognizable picture languages to find deterministic subclasses
- Tiling Recognizable Two-Dimensional Languages
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
Cited in
(14)- Deterministic Two-Dimensional Languages over One-Letter Alphabet
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
- Classification of string languages via tiling recognizable picture languages
- On the Complexity of Unary Tiling-Recognizable Picture Languages
- Two-way Automata and Regular Languages of Overlapping Tiles
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- Exploring inside tiling recognizable picture languages to find deterministic subclasses
- Tiling Recognizable Two-Dimensional Languages
- Unambiguous recognizable two-dimensional languages
- Framed Versus Unframed Two-Dimensional Languages
- Some remarks on tiling recognizable languages
- A computational model for tiling recognizable two-dimensional languages
- On the tiling system recognizability of various classes of convex polyominoes
This page was built for publication: A brief excursion inside the class of tiling recognizable two-dimensional languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584878)