Rectangles and squares recognized by two-dimensional automata

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

Volumn 3113, Issue , 2004, Pages 134-144

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

^a UNIVERSITY OF TURKU   (Finland)

^b University of Iowa   (United States)

^c MSC01 1070   (United States)

^d SANTA FE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS;

TWO-DIMENSIONAL AUTOMATA;

GEOMETRY;

EID: 21144450803     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27812-2_13     Document Type: Article

References (13)

1. M. Blum and C. Hewitt (1967), Automata on a 2-dimensional tape. 8th IEEE Symp. on Switching and Automata Theory 155-160.
2. B. Borchert, http://math.uni-heidelberg.de/logic/bb/2dpapers.html
3. D. Giammarresi and A. Restivo (1992) Recognizable picture languages. Int. J. of Pattern Recognition and Artificial Intelligence 6(2-3) 241-256.
4. D. Giammarresi and A. Restivo (1996) Two-dimensional languages. In G. Rosenberg and A. Salomaa, Eds., Handbook of Formal Languages, Volume III, pp. 215-267. Springer-Verlag.
5. K. Inoue and A. Nakamura (1977) Some properties of two-dimensional on-line tesselation acceptors. Information Sciences 13 95-121.
6. K. Inoue and A. Nakamura (1979) Two-dimensional finite automata and unacceptable functions. Int. J. Comput. Math. A 7 207-213.
7. K. Inoue and I. Takanami (1991) A survey of two-dimensional automata theory. Information Sciences 55 99-121.
8. J. Kari and C. Moore (2001) New results on alternating and non-deterministic two-dimensional finite automata. "Proceedings of STACS'2001, 18th Annual Symposium on Theoretical Aspects of Computer Science". Lecture Notes in computer Science 2010, 396-406, Springer-Verlag.
9. K. Lindgren, C. Moore and M.G. Nordahl (1998) Complexity of two-dimensional patterns. Journal of Statistical Physics 91 909-951.
10. D.L. Milgram (1976) A region crossing problem for array-bounded automata. Information and Control 31 147-152.
11. M. Minsky (1967) Computation: Finite and Infinite Machines. Prentice-Hall.
12. A. Rosenfeld (1979) Picture Languages: Formal Models for Picture Recognition. Academic Press.
13. M. Sipser (1980) Halting space-bounded computations. Theoretical Computer Science 10 335-338.