From determinism to non-determinism in recognizable two-dimensional languages

Authors:
Marcella Anselmo;Dora Giammarresi;Maria Madonia
Affiliations:
Dipartimento di Informatica ed Applicazioni, Università di Salerno, Fisciano, SA, Italy;Dipartimento di Matematica. Università di Roma "Tor Vergata", Roma, Italy;Dip. Matematica e Informatica, Università di Catania, Catania, Italy
Venue:
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Year:
2007

Citing 7
Cited 16

Two-dimensional languages

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

Automata, Languages, and Machines
On Some Recognizable Picture-Languages

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A Characterization of Recognizable Picture Languages

ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
On Piecewise Testable, Starfree, and Recognizable Picture Languages

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
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

On Complexity of Two Dimensional Languages Generated by Transducers

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
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: From Wang Tiles to 2D Grammars

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
A computational model for tiling recognizable two-dimensional languages

Theoretical Computer Science
Picture Recognizability with Automata Based on Wang Tiles

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Tiling automaton: a computational model for recognizable two-dimensional languages

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
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 two-dimensional languages over one-letter alphabet

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

Fundamenta Informaticae
Transducer generated arrays of robotic nano-arms

Natural Computing: an international journal
A brief excursion inside the class of tiling recognizable two-dimensional languages

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Towards more expressive 2D deterministic automata

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Two-dimensional sgraffito automata

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes deterministic automata for strings. The corresponding family of languages matches all the requirements of a robust deterministic class. Furthermore we show that, differently from the one-dimensional case, there exist many classes between deterministic and non-deterministic families that we separate by means of examples and decidability properties.