Unambiguous recognizable two-dimensional languages

RAIRO - Theoretical Informatics and Applications

Volumn 40, Issue 2, 2006, Pages 277-293

  Anselmo, Marcella ^a   Giammarresi, Dora ^b   Madonia, Maria ^c   Restivo, Antonio ^d  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c UNIVERSITY OF CATANIA   (Italy)

^d UNIVERSITY OF PALERMO   (Italy)

Author keywords

Automata and formal languages; Determinism; Two dimensional languages; Unambiguity

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL METHODS; FORMAL LOGIC; TWO DIMENSIONAL;

AUTOMATA AND FORMAL LANGUAGES; DETERMINISM; TWO-DIMENSIONAL LANGUAGES; UNAMBIGUITY;

FORMAL LANGUAGES;

EID: 33746278660     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2006008     Document Type: Article

References (24)

1. M. Anselmo, D. Giammarresi and M. Madonia, New Operations and Regular Expressions for two-dimensional languages over one-letter alphabet. Theoret. Comput. Sci. 340 (2005) 408-431.
2. J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985).
3. A. Bertoni, G. Mauri and N. Sabadini, Unambiguous regular trace languages, in Algebra, Combinatorics and Logic in Computer Science, edited by J. Demetrovics, G. Katona and A. Salomaa, North Holland. Math. Soc. Janos Bolyay 42 (1985).
4. S. Bozapalidis and A. Grammatikopoulou, Recognizable picture series, in Special Issue on Weighted Automata. Journal of Automata, Languages and Combinatorics, Vol. 10, No. 2 (2005).
5. M. Blum and C. Hewitt, Automata on a two-dimensional tape, in IEEE Symposium on Switching and Automata Theory (1967) 155-160.
6. C. Choffrut and B. Durak, Collage of two-dimensional words. Theoret. Comput. Sci. 340 (2005) 364-380.
7. M. Chrobak and W. Rytter, Unique decipherability for partially commutative alphabets. Fundamenta Informatica X (1987) 323-336.
8. S. Crespi Reghizzi and M. Pradella, Tile rewriting grammars and picture languages. Theoret. Comput. Sci. 340 (2005) 257-272.
9. S. Eilenberg, Automata, Languages and Machines. Vol. A, Academic Press (1974).
10. D. Giammarresi and A. Restivo, Recognizable picture languages. International Journal Pattern Recognition and Artificial Intelligence 6 (1992) 241-256.
11. D. Giammarresi and A. Restivo, Two-dimensional languages, in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Springer-Verlag, Berlin III (1997) 215-268.
12. D. Giammarresi, A. Restivo, S. Seibert and W. Thomas, Monadic second order logic over pictures and recognizability by tiling systems. Inform. Computat. 125 (1996) 32-45.
13. J. Hromkovic, J. Karumäki, H. Klauck, G. Schnitger and S. Seibert, Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inform. Comput. 172 (2002) 202-217.
14. K. Inoue and A. Nakamura, Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13 (1977) 95-121.
15. K. Inoue and A. Nakamura, Nonclosure properties of two-dimensional on-line tessellation acceptors and one-way parallel/sequential array acceptors. Trans. IECE Japan 6 (1977) 475-476.
16. K. Inoue and I. Takanami, A Characterization of recognizable picture languages, in Proc. Second International Colloquium on Parallel Image Processing, edited by A. Nakamura et al. Lect. Notes Comput. Sci. 654 (1993).
17. J. Kari and C. Moore, Rectangles and squares recognized by two-dimensional automata, in Theory is Forever, edited by Karhumaki et al. Lect. Notes Comput. Sci. 3113 (2004) 134-144.
18. O. Matz, On piecewise testable, starfree, and recognizable picture languages, in Foundations of Software Science and Computation Structures, edited by M. Nivat, Springer-Verlag, Berlin 1378 (1998).
19. O. Matz and W. Thomas, The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite, in IEEE Symposium on Logic in Computer Science, LICS. IEEE (1997) 236-244.
20. I. Mäurer, Recognizable and Rational Picture Series, in Procs. Conf. on Algebraic Informatics, Thessaloniki (2005), Aristotte University of Thessaloniki.
21. I. Mäurer, Weighted Picture Automata and Weighted Logics, in Procs. STACS 2006, Springer Belin. Lect. Notes Comput. Sci. 3884 (2006) 313-324.
22. A. Potthoff, S. Seibert and W. Thomas, Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bulletin Belgian Math. Soc. 1 (1994) 285-298.
23. J. Sakarovitch, Eléments de théorie des automates. Vuibert, Paris (2003).
24. W. Thomas, On Logics, Tilings, and Automata, in Proc. 18th ICALP, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 510 (1991) 441-453.