From determinism to non-determinism in recognizable two-dimensional languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4588 LNCS, Issue , 2007, Pages 36-47

  Anselmo, Marcella ^a   Giammarresi, Dora ^b   Madonia, Maria ^c  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c UNIVERSITY OF CATANIA   (Italy)

Author keywords

Automata and formal languages; Two dimensional languages; Unambiguity, determinism

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DATA STRUCTURES; FORMAL LANGUAGES; PATTERN MATCHING; ROBUST CONTROL;

DECIDABILITY PROPERTIES; NON-DETERMINISTIC FAMILIES; TWO-DIMENSIONAL LANGUAGES;

AUTOMATA THEORY;

EID: 34548072019     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73208-2_7     Document Type: Conference Paper

References (14)

1. Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous Recognizable Two-dimensional Languages. RAIRO: Theoretical Informatics and Applications EDP Sciences 2006 40(2), 227-294 (2006)
2. Bertoni, A., Goldwurm, M., Lonati, V.: On the complexity of unary tilingrecognizable picture languages. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, Springer-Verlag, Heidelberg (To appear, 2007)
3. Blum, M., Hewitt, C.: Automata on a two-dimensional tape. IEEE Symposium on Switching and Automata Theory, pp. 155-160 (1967)
4. B. Borchert, K. Reinhardt. Deterministically and Sudoku-Deterministically Recognizable Picture Languages, http://vww-fs.informatik.uni-tuebingen.de/ ~borchert/papers/Borchert-Reinhardt_2006_Sudoku.pdf
5. Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, San Diego (1974)
6. Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. Journal Pattern Recognition and Artificial Intelligence 6(2, 3), 241-256 (1992)
7. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (ed.) Handbook of Formal Languages, vol. III, pp. 215-268. Springer Verlag, Heidelberg (1997)
8. Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13, 95-121 (1977)
9. Inoue, K., Nakamura, A.: Nonclosure properties of two-dimensional on-line tessellation acceptors and one-way parallel/sequential array acceptors. Transaction of IECE of Japan 6, 475-476 (1977)
10. Inoue, K., Takanami, I.: A characterization of recognizable picture languages. In: Nakamura, A., Saoudi, A., Inoue, K., Wang, P.S.P., Nivat, M. (eds.) ICPIA 1992. LNCS, vol. 654, Springer-Verlag, Berlin Heidelberg (1993)
11. Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. Journal of Statistical Physics 91(5-6), 909-951 (1998)
12. Matz, O.: On piecewise testable, starfree, and recognizable picture languages. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, Springer, Heidelberg (1998)
13. Potthoff, A., Seibert, S., Thomas, W.: Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bull. Belgian Math. Soc. 1, 285-298 (1994)
14. Reinhardt, K.: On some recognizable picture-languages, In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 760-770. Springer, Heidelberg (1998)