From Determinism to Non-determinism in Recognizable Two-Dimensional Languages

DOI10.1007/978-3-540-73208-2_7MaRDI QIDQ5428218zbMATH OpenOpenAlexFDO

Authors Marcella Anselmo, Dora Giammarresi, Maria 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

zbMATH Keywords

DeterminismTwo-dimensional languagesUnambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• Deterministic and unambiguous two-dimensional languages over one-letter alphabet
• Comparing necessary conditions for recognizability of two-dimensional languages
• Classes of two-dimensional languages and recognizability conditions
• A stronger recognizability condition for two-dimensional languages
• scientific article; zbMATH DE number 2038729
• On non-determinism in machines and languages
• Deterministic Two-Dimensional Languages over One-Letter Alphabet
• On Complexity of Two Dimensional Languages Generated by Transducers
• A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages

Cited in

(21)

• Deterministic and unambiguous two-dimensional languages over one-letter alphabet
• Exploring inside tiling recognizable picture languages to find deterministic subclasses
• Some classes of rational functions for pictures
• Classes of two-dimensional languages and recognizability conditions
• Strategies to scan pictures with automata based on Wang tiles
• Snake-Deterministic Tiling Systems
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Tiling Recognizable Two-Dimensional Languages
• Recognizable vs. Regular Picture Languages
• Deterministic Two-Dimensional Languages over One-Letter Alphabet
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• A brief excursion inside the class of tiling recognizable two-dimensional languages
• Framed Versus Unframed Two-Dimensional Languages
• On Complexity of Two Dimensional Languages Generated by Transducers
• Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
• Towards more expressive 2D deterministic automata
• Automata with cyclic move operations for picture languages
• Two-dimensional Sgraffito automata
• Transducer generated arrays of robotic nano-arms
• Deterministic ordered restarting automata for picture languages
• A computational model for tiling recognizable two-dimensional languages

This page was built for publication: From Determinism to Non-determinism in Recognizable Two-Dimensional Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428218)