Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages

Authors:
Marcella Anselmo;Dora Giammarresi;Maria Madonia
Affiliations:
Dip. di Informatica ed Applicazioni, Universit`a di Salerno. I-84084 Fisciano (SA) Italy. E-mail: anselmo@dia.unisa.it;Dip. Matematica, Università di Roma "Tor Vergata", via Ricerca Scientifica, 00133 Roma, Italy. E-mail: giammarr@mat.uniroma2.it;Dip. Matematica e Informatica, Università di Catania, Viale Andrea Doria 6/a, 95125 Catania, Italy. E-mail: madonia@dmi.unict.it
Venue:
Fundamenta Informaticae
Year:
2010

Citing 16
Cited 3

Monadic second-order logic over rectangular pictures and recognizability by tiling systems

Information and Computation
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
Automata Theory on Trees and Partial Orders

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
On Piecewise Testable, Starfree, and Recognizable Picture Languages

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A SAT-based parser and completer for pictures specified by tiling

Pattern Recognition
Deterministic and unambiguous two-dimensional languages over one-letter alphabet

Theoretical Computer Science
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

Fundamenta Informaticae - Machines, Computations and Universality, Part II
Snake-Deterministic Tiling Systems

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
A computational model for tiling recognizable two-dimensional languages

Theoretical Computer Science
Automata on a 2-dimensional tape

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
From determinism to non-determinism in recognizable two-dimensional languages

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Tiling automaton: a computational model for recognizable two-dimensional languages

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Deterministic two-dimensional languages over one-letter alphabet

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics

Comparing necessary conditions for recognizability of two-dimensional languages

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Classification of string languages via tiling recognizable picture languages

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Towards more expressive 2D deterministic automata

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recognizable two-dimensional languages (REC) are defined by tiling systems that generalize to two dimensions non-deterministic finite automata for strings. We introduce the notion of deterministic tiling system and the corresponding family of languages (DREC) and study its structural and closure properties. Furthermore we show that, in contrast with the one-dimensional case, there exist other classes between deterministic and non-deterministic families that we separate by means of examples and decidability properties.