Deterministic two-dimensional languages over one-letter alphabet

Authors:
Marcella Anselmo;Maria Madonia
Affiliations:
Dipartimento di Informatica ed Applicazioni, Università di Salerno, Fisciano, SA, Italy;Dip. Matematica e Informatica, Università di Catania, Catania, Italy
Venue:
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Year:
2007

Citing 11
Cited 10

Three-way automata on rectangular tapes over a one-letter alphabet

Information Sciences: an International Journal
Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180:9D-rotations

Theoretical Computer Science
Two-dimensional languages

Handbook of formal languages, vol. 3
Automata, Languages, and Machines

Automata, Languages, and Machines
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures

Theoretical Computer Science
A Characterization of Recognizable Picture Languages

ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
Regular Expressions and Context-Free Grammars for Picture Languages

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
New operations and regular expressions for two-dimensional languages over one-letter alphabet

Theoretical Computer Science - The art of theory
Automata on a 2-dimensional tape

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
On the complexity of unary tiling-recognizable picture languages

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
From determinism to non-determinism in recognizable two-dimensional languages

DLT'07 Proceedings of the 11th international conference on Developments in language theory

Framed Versus Unframed Two-Dimensional Languages

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Deterministic and unambiguous two-dimensional languages over one-letter alphabet

Theoretical Computer Science
Picture Languages Generated by Assembling Tiles

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

Fundamenta Informaticae - Machines, Computations and Universality, Part II
A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Tiling recognizable two-dimensional languages

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Recognizable vs. regular picture languages

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages

Fundamenta Informaticae
Picture Languages Generated by Assembling Tiles

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

Fundamenta Informaticae - Machines, Computations and Universality, Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the family DREC(1) of deterministic tiling recognizable two-dimensional languages in the case of a one-letter alphabet. The family coincides with both the class of languages accepted by deterministic on-line tessellation acceptors (L(DOTA)(1)) and the one of languages recognized by 2-way alternating finite automata (L(2AFA)(1)). We show that DREC(1) is complex enough to contain languages that cannot be realized by classical operations, while other languages constructed using classical operations cannot be deterministically recognized. Furthermore we prove that there are unambiguously recognizable languages that cannot be deterministically recognized even in the case of one-letter alphabet. In particular L(DOTA)(1) is different from L(OTA)(1) (its non-deterministic counterpart).