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
%0 Book Section
%1 anselmo2007determinism
%A Anselmo, Marcella
%A Giammarresi, Dora
%A Madonia, Maria
%B Developments in Language Theory
%D 2007
%E Harju, Tero
%E Karhumäki, Juhani
%E Lepistö, Arto
%I Springer Berlin Heidelberg
%K 2013 languages pictue project systems tiling
%P 36-47
%R 10.1007/978-3-540-73208-2_7
%T From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
%U http://dx.doi.org/10.1007/978-3-540-73208-2_7
%V 4588
%X 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.
%@ 978-3-540-73207-5
@incollection{anselmo2007determinism,
abstract = {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.},
added-at = {2013-07-09T21:19:39.000+0200},
author = {Anselmo, Marcella and Giammarresi, Dora and Madonia, Maria},
biburl = {https://www.bibsonomy.org/bibtex/211077c2b7c8a4a75205eef5640acc178/s_6wg2xw},
booktitle = {Developments in Language Theory},
description = {From Determinism to Non-determinism in Recognizable Two-Dimensional Languages - Springer},
doi = {10.1007/978-3-540-73208-2_7},
editor = {Harju, Tero and Karhumäki, Juhani and Lepistö, Arto},
interhash = {910ee93c44393eb594992ae376ca4145},
intrahash = {11077c2b7c8a4a75205eef5640acc178},
isbn = {978-3-540-73207-5},
keywords = {2013 languages pictue project systems tiling},
pages = {36-47},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
timestamp = {2014-04-07T15:54:18.000+0200},
title = {From Determinism to Non-determinism in Recognizable Two-Dimensional Languages},
url = {http://dx.doi.org/10.1007/978-3-540-73208-2_7},
volume = 4588,
year = 2007
}