Tiling-recognizable Two-dimensional Languages: from Non-determinism to Determinism through Unambiguity

Dora Giammarresi (1)

1 DIPMAT - Dipartimento di Matematica [Roma II]

Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and the membership problem is NP-complete. This implies that this family REC is intrinsically non-deterministic. The natural and immediate definition of unambiguity corresponds to a family UREC of languages that is strictly contained in REC. On the other hand this definition of unambiguity leads to an undecidability result and therefore it cannot correspond to any deterministic notion. We introduce the notion of line-unambiguous tiling recognizable languages and prove that it corresponds or somehow naturally introduces different notions of determinism that define a hierarchy inside REC.

Mots clés: automata and formal languages; two-dimensional languages; tiling systems; unambiguity; determinism

Domaines: Autre [cs.OH]

Dora Giammarresi. Tiling-recognizable Two-dimensional Languages: from Non-determinism to Determinism through Unambiguity. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.8-12. ⟨hal-00541890⟩