Deterministic and unambiguous two-dimensional languages over one-letter alphabet
From MaRDI portal
Publication:1013124
DOI10.1016/J.TCS.2008.12.009zbMATH Open1162.68020OpenAlexW1979836160MaRDI QIDQ1013124FDOQ1013124
Authors: Marcella Anselmo, Maria Madonia 
Publication date: 16 April 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.009
Recommendations
- Deterministic Two-Dimensional Languages over One-Letter Alphabet
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Unambiguous recognizable two-dimensional languages
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- A brief excursion inside the class of tiling recognizable two-dimensional languages
Cites Work
- Rational sets in commutative monoids
- Title not available (Why is that?)
- Complexity of two-dimensional patterns
- Unambiguous recognizable two-dimensional languages
- Weighted Picture Automata and Weighted Logics
- Some properties of two-dimensional on-line tessellation acceptors
- Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\(\circ\)-rotation
- Two-dimensional alternative Turing machines
- Regular expressions and context-free grammars for picture languages
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- New operations and regular expressions for two-dimensional languages over one-letter alphabet
- Three-way automata on rectangular types over a one-letter alphabet
- Theory Is Forever
- On the Complexity of Unary Tiling-Recognizable Picture Languages
- Title not available (Why is that?)
- Nondeterminism versus determinism of finite automata over directed acyclic graphs
- Two-dimensional finite automata and unacceptable functions
- Recognizable vs. Regular Picture Languages
- Deterministic Two-Dimensional Languages over One-Letter Alphabet
- Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Cited In (12)
- Relative approximate bisimulations for fuzzy picture automata
- Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
- Exploring inside tiling recognizable picture languages to find deterministic subclasses
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Classes of two-dimensional languages and recognizability conditions
- Framed Versus Unframed Two-Dimensional Languages
- Comparing necessary conditions for recognizability of two-dimensional languages
- Picture codes and deciphering delay
- Two-dimensional models
- Structure and properties of strong prefix codes of pictures
- Deterministic Two-Dimensional Languages over One-Letter Alphabet
This page was built for publication: Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013124)
