Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
From MaRDI portal
Publication:3560552
DOI10.3233/FI-2010-221zbMATH Open1196.68117MaRDI QIDQ3560552FDOQ3560552
Authors: Marcella Anselmo, Dora Giammarresi, Maria Madonia 
Publication date: 14 May 2010
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- Unambiguous recognizable two-dimensional languages
- Classes of two-dimensional languages and recognizability conditions
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- A stronger recognizability condition for two-dimensional languages
- Comparing necessary conditions for recognizability of two-dimensional languages
- A new characterization of nondeterministically recognizable families of languages
- Deterministic Two-Dimensional Languages over One-Letter Alphabet
- On Some Classes of 2D Languages and Their Relations
Cited In (28)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- Two-dimensional codes
- Towards more expressive 2D deterministic automata
- Unbordered Pictures: Properties and Construction
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- Two-dimensional pattern matching against local and regular-like picture languages
- Exploring inside tiling recognizable picture languages to find deterministic subclasses
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- A brief excursion inside the class of tiling recognizable two-dimensional languages
- Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory
- Deterministic ordered restarting automata for picture languages
- Tiling Recognizable Two-Dimensional Languages
- On Some Classes of 2D Languages and Their Relations
- Unambiguous recognizable two-dimensional languages
- Classes of two-dimensional languages and recognizability conditions
- Framed Versus Unframed Two-Dimensional Languages
- Title not available (Why is that?)
- Sets of Pictures Avoiding Overlaps
- Comparing necessary conditions for recognizability of two-dimensional languages
- Picture codes and deciphering delay
- Title not available (Why is that?)
- Two-dimensional models
- A computational model for tiling recognizable two-dimensional languages
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- Structure and properties of strong prefix codes of pictures
- Deterministic Two-Dimensional Languages over One-Letter Alphabet
- Automata with cyclic move operations for picture languages
- Characterization and measure of infinite two-dimensional strong prefix codes
This page was built for publication: Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560552)
