From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
From MaRDI portal
Publication:5428218
DOI10.1007/978-3-540-73208-2_7zbMath1202.68218OpenAlexW1601020901MaRDI QIDQ5428218
Marcella Anselmo, Dora Giammarresi, Marina Madonia
Publication date: 28 November 2007
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_7
Related Items (18)
A computational model for tiling recognizable two-dimensional languages ⋮ Snake-Deterministic Tiling Systems ⋮ Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages ⋮ Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton ⋮ Some classes of rational functions for pictures ⋮ Tiling Recognizable Two-Dimensional Languages ⋮ Recognizable vs. Regular Picture Languages ⋮ Deterministic Two-Dimensional Languages over One-Letter Alphabet ⋮ Classes of two-dimensional languages and recognizability conditions ⋮ Strategies to scan pictures with automata based on Wang tiles ⋮ Framed Versus Unframed Two-Dimensional Languages ⋮ On Complexity of Two Dimensional Languages Generated by Transducers ⋮ Towards More Expressive 2D Deterministic Automata ⋮ Transducer generated arrays of robotic nano-arms ⋮ Deterministic and unambiguous two-dimensional languages over one-letter alphabet ⋮ Deterministic ordered restarting automata for picture languages ⋮ Automata with cyclic move operations for picture languages ⋮ Two-dimensional Sgraffito automata
This page was built for publication: From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
