Classes of two-dimensional languages and recognizability conditions
From MaRDI portal
Publication:2998728
DOI10.1051/ITA/2011003zbMATH Open1211.68230OpenAlexW2120092168MaRDI QIDQ2998728FDOQ2998728
Authors: Marcella Anselmo, Maria Madonia 
Publication date: 10 May 2011
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/193071
Recommendations
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- Comparing necessary conditions for recognizability of two-dimensional languages
- A stronger recognizability condition for two-dimensional languages
- scientific article; zbMATH DE number 871248
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A lower bound technique for the size of nondeterministic finite automata
- Framed Versus Unframed Two-Dimensional Languages
- Intersection and union of regular languages and state complexity
- Communication complexity method for measuring nondeterminism in finite automata
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- Unambiguous recognizable two-dimensional languages
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Matrix-based complexity functions and recognizable picture languages
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- Characterizations of recognizable picture series
- Title not available (Why is that?)
- Nondeterminism versus determinism of finite automata over directed acyclic graphs
- Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
- Snake-Deterministic Tiling Systems
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
Cited In (13)
- Communication complexity tools on recognizable picture languages
- Languages recognized by programs over the two-element monoid
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
- On Some Classes of 2D Languages and Their Relations
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Matrix-based complexity functions and recognizable picture languages
- Comparing necessary conditions for recognizability of two-dimensional languages
- A stronger recognizability condition for two-dimensional languages
- Two-dimensional connected pictures are not recognizable by finite-state acceptors
- Two-dimensional models
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
- On Complexity of Two Dimensional Languages Generated by Transducers
- ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS
This page was built for publication: Classes of two-dimensional languages and recognizability conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998728)
