From Determinism to Non-determinism in Recognizable Two-Dimensional Languages

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.

• Type: Conference
• Year: 2007
• Where: DLT
• Authors: Marcella Anselmo, Dora Giammarresi, Maria Madonia
• Keywords: Deterministic, Deterministic Automata, Deterministic Tiling, DLT 2007, Theoretical Computer Science