Snew results on alternating and non-deterministic two-dimensional finite-state automata

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

Volumn 2010, Issue , 2001, Pages 396-406

  Kari, Jarkko ^a   Moore, Cristopher ^b,c  

^a University of Iowa   (United States)

^b University of New Mexico   (United States)

^c SANTA FE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; NANOSTRUCTURED MATERIALS;

COMPLEMENTATION; GRID GRAPHS; RECOGNIZABLE LANGUAGES; TWO-DIMENSIONAL ARRAYS;

AUTOMATA THEORY;

EID: 84957045952     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_35     Document Type: Conference Paper

References (15)

1. M. Blum and C. Hewitt, Automata on a 2-dimensional tape." 8th IEEE Symp. on Switching and Automata Theory (1967) 155-160.
2. B. Borchert, http://math.uni-heidelberg.de/logic/bb/2dpapers.html.
3. D. Giammarresi and A. Restivo, Recognizable picture languages." Int. J. of Pattern Recognition and Artificial Intelligence 6(2-3) (1992) 241-256.
4. D. Giammaresi, Two-dimensional languages and recognizable functions." In G. Rozenberg and A. Salomaa, Eds., Proc. Developments in Language Theory. World Scientific (1994) 290-301.
5. D. Giammarresi and A. Restivo, Two-dimensional languages." In G. Rosen-berg and A. Salomaa, Eds., Handbook of Formal Languages, Volume 3. Springer Verlag (1996) 215-267.
6. K. Inoue and A. Nakamura, Some properties of two-dimensional on-line tessellation acceptors." Information Sciences 13 (1977) 95-121.
7. K. Inoue and A. Nakamura, Two-dimensional finite automata and unac-ceptable functions." Int. J. Comput. Math. A 7 (1979) 207-213.
8. K. Inoue and I. Takanami, A survey of two-dimensional automata theory." Information Sciences 55 (1991) 99-121.
9. K. Lindgren, C. Moore and M.G. Nordahl, Complexity of two-dimensional patterns." Journal of Statistical Physics 91 (1998) 909-951.
10. O. Matz, Dot-depth, monadic quantifier alternation and first-Order closure over grids and pictures." To appear in Theoretical Computer Science.
11. D.L. Milgram, A region crossing problem for array-bounded automata." Information and Control 31 (1976) 147-152.
12. M. Minsky, Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
13. A. Rosenfeld, Picture Languages: Formal Models for Picture Recognition. Academic Press, 1979.
14. M. Sipser, Halting space-bounded computations." Theoretical Computer Science 10 (1980) 335-338.
15. A. Szepietowski, Two-dimensional on-line tesselation acceptors are not closed under complement." Information Sciences, 64 (1992) 115-120.