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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Anselmo, M., Giammarresi, D., & Madonia, M. (2007). From determinism to non-determinism in recognizable two-dimensional languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4588 LNCS, pp. 36–47). Springer Verlag. https://doi.org/10.1007/978-3-540-73208-2_7
Mendeley helps you to discover research relevant for your work.