@s_6wg2xw

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

, , und . Developments in Language Theory, Volume 4588 von Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)
DOI: 10.1007/978-3-540-73208-2_7

Zusammenfassung

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.

Beschreibung

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

Links und Ressourcen

Tags

Community

  • @dblp
  • @s_6wg2xw
@s_6wg2xws Tags hervorgehoben