Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages

DOI10.3233/FI-2010-221MaRDI QIDQ3560552zbMATH OpenFDO

Authors Marcella Anselmo, Dora Giammarresi, Maria Madonia

Publication date 14 May 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2010-221

zbMATH Keywords

tiling systemsunambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

(30)

• Deterministic and unambiguous two-dimensional languages over one-letter alphabet
• Two-dimensional pattern matching against local and regular-like picture languages
• Two-dimensional models
• Two-dimensional codes
• Characterization and measure of infinite two-dimensional strong prefix codes
• Exploring inside tiling recognizable picture languages to find deterministic subclasses
• Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
• Unbordered pictures: properties and construction
• Structure and properties of strong prefix codes of pictures
• Classes of two-dimensional languages and recognizability conditions
• On Some Classes of 2D Languages and Their Relations
• Comparing necessary conditions for recognizability of two-dimensional languages
• scientific article; zbMATH DE number 3861188 (Why is no real title available?)
• Unambiguous recognizable two-dimensional languages
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Tiling Recognizable Two-Dimensional Languages
• Deterministic Two-Dimensional Languages over One-Letter Alphabet
• A brief excursion inside the class of tiling recognizable two-dimensional languages
• Framed Versus Unframed Two-Dimensional Languages
• A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
• Picture codes and deciphering delay
• Towards more expressive 2D deterministic automata
• Sets of pictures avoiding overlaps
• Automata with cyclic move operations for picture languages
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
• A stronger recognizability condition for two-dimensional languages
• scientific article; zbMATH DE number 7770057 (Why is no real title available?)
• Deterministic ordered restarting automata for picture languages
• A new characterization of nondeterministically recognizable families of languages
• A computational model for tiling recognizable two-dimensional languages

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)