A survey of two-dimensional automata theory

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

Volumn 381 LNCS, Issue , 1989, Pages 72-91

  Inoue, Katsushi ^a   Takanami, Itsuo ^a  

^a YAMAGUCHI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

TURING MACHINES;

TWO-DIMENSIONAL AUTOMATA;

SURVEYS;

EID: 84948139630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0015929     Document Type: Conference Paper

References (116)

1. H. Antelmann, L. Budach and H. A. Rollik, On universal traps, EIK 15, 3 (1979),123-131.
2. T. Beyer, Recognition of topological invariants by iterative arrays, Ph.d. Thesis, MIT, 1970.
3. M. Blum and C. Hewitt, Automata on a two-dimensional tape, IEEE Symposium on Switching and Automata Theory, 1967, 155-160.
4. M. Blum and D. Eozen, On the power of the compass, Proc. On Theoryf the 19th Annual Symp. On Theoryn Foundations of Computer Science, 1978.
5. M. Blum and W. J. Sakoda, On the capability of finite automata in 2 and 3 dimensional space, Proc. On Theoryf the 18th Annual Symp. On Theoryn Foundations of Computer Science, 1977, 147-161.
6. W. Bucher and K. Culik If, On real time and linear time cellular automata, Research Report 115, Institute fur Informationsverarbeitung, Technical University of Graz, 1983.
7. L. Budach, Environments, labyrinths and Automata, Lecture Notes in Computer Science 56, Springer Verlag, 1977.
8. L. Budach, Automata and Labyrinths, Math. Nachr, 86 (1978), 195-282.
9. L. Budach and C. Meinel, Environments and automata I, EIK 18, 1/2 (1982), 13-40.
10. L. Budach and C. Meinel, Environments and automata II, EIK 18, 3 (1982), 115-139.
11. A.K. Chandra, D.C. Kozen and L.d. Stockmeyer, Alternation, J.Assoc.Oomput.Mach. 28, 1 (1981), 114-133.
12. C. Choffrut and K. Culik If, On real-time cellular automata and trellis automata, Research Report FI14, Institute fur Informationsverarbeitung, Technical University of Graz, 1983.
13. P. Dietz and S. R. Kosaraju, Recognition of topological equivalence of patterns by array automata, JCSS 2 (1980), 111-116.
14. C. R. Dyer, One-way hounded cellular automata, Information and Control 44 (1980),261-281.
15. C. R. Dyer, Relation of one-wayparallel/sequential automata to 2-d finite automata, Information Sciences 23 (1981), 25-30.
16. C. R. Dyer and A. Rosenfeld, Cellular pyramids for image analysis, University of Maryland, Computer Science Center, TR-544, AFOSR-77- 3271, 1977.
17. C.R. Dyer and A. Rosenfeld, Parallel image processing by memory-augmented cellular automata, IEEE Trans. On Theoryn Pattern Analysis and Machine Intelligence, PAMI-3, 1 (1981), 29-41.
18. C.R. Dyer and A. Rosenfeld, Triangle cellular automata, Information and Control 48 (1981), 54- 69.
19. E.M. Ehlers and S.H. Von Solms, A hierarchy of random context grammars and automata, Information Sciences 42 (1987), 1-29.
20. M.J. Fisher, Two characterizations of the context sensitive languages, IEEE Symp. On Theoryn Switching and Automata Theory (1969), 149-156.
21. J. Hartmanis, The structural complexity column, Bulletin of the EATCS, 33 (October 1987), 26-39.
22. A. Hemmerling, Normed two-plane traps for finite systems of cooperating compass automata, EIK 23, 8/9 (1987), 453-470.
23. F. Hoffmann, One pebble does not suffice to search plane labyrinths, Lecture Notes in Computer Science 117 (Fundamentals of Computation Theory), 1981, 433-444.
24. J.E. Hopcroft and J.D. Ullman, Some results on tape-bounded Turing machines, J.Assoc. Comput.Math. 19, 2 (1972), 283-295.
25. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass. 1979.
26. J. Hromkovic, K. Inoue and I. Takanami, Lower bounds for language recognition on two-dimensional alternating multihead machines, To appear in JCSS.
27. O.H. Ibarra and R.T. Melson, Some results concerning automata on twodimensional tapes, Intern.J.Computer Math. 4-A (1974), 269-279.
28. N. Immerman, Nondeterministic space is closed under complement, submitted for publication.
29. K. Inoue, Investigations of two-dimensional on-line tessellation acceptors (in Japanese), Ph.d. Thesis, Nagoya University, 1977.
30. K. Inoue and A. Nakamura, Some notes on parallel sequential array acceptors (in Japanese), IECE of Japan Trans.(D), March 1975, 167-169.
31. K. Inoue and A. Nakamura, On the relation between two-dimensional online tessellation acceptors and one-dimensional bounded cellular acceptor s (in Japanese), IECE of Japan Trans.(D), September 1976, 613-620.
32. K. Inoue and A. Nakamura, Some properties of one-way parallel sequential array acceptors and two-dimensional one-marker automata (in Japanese), IECE of Japan Trans.(D), September 1976, 682-683.
33. K. Inoue and A. Nakamura, Some properties of parallel sequential array acceptors and twodimensional two-marker automata (in Japanese), IECE of Japan Trans.(D), September 1976, 680-681.
34. K. Inoue and A. Nakamura, Some properties of two-dimensional online tessellation acceptors (in Japanese), IECE of Japan Trans.(D), October 1976, 695-702.
35. K. Inoue and A. Nakamura, Some properties of two-dimensional online tessellation acceptors, Information Sciences 13 (1977), 95-121.
36. K. Inoue and A. Nakamura, Some properties of two-dimensional automata with a one - letter alphabet -Recognizability of functions by two-dimensional automata- (in Japanese), IECE of Japan Trans.(D), September 1977, 679-686.
37. K. Inoue and A. Nakamura, Nonclosure properties of two-dimensional on-line tessellation acceptors and one-way parallel sequential array acceptors, 1ECE of Japan Trans.(E), September 1977, 475-476.
38. K. Inoue and A. Nakamura,Some properties on two-dimensional nondeterministic finiteautomata and parallel sequential array acceptors (in Japanese), IECE of Japan Trans.(D), November 1977, 990-997.
39. K. Inoue and A. Nakamura, Two-dimensional multipass on-line tessellation acceptors, Information and Control 41, 3 (June 1979), 305-323.
40. K. Inoue and A. Nakamura,Two-dimensional finite automata and unacceptable functions, Intern. J. Computer Math. Section A, 7 (1979), 207-213.
41. K. Inoue and I. Takanami, A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional Turing machines, Information Sciences 15, 1 (1978), 143-158.
42. K. Inoue and I. Takanami, Cyclic closure properties of automata on a two-dimensional tape, Information Sciences 15, 1 (1978), 229-242.
43. K. Inoue and I. Takanami, A note on bottom-up pyramid acceptors, Information Processing Letters 8, 1 (1979), 34-37.
44. K. Inoue and I. Takanami, Three-way tape-bounded two-dimensional Turing machines, Information Sciences 17, 3 (1979), 195-220.
45. K. Inoue and I. Takanami, Closure properties of three-way and four-way tape-bounded two-dimensional Turing machines, Information Sciences 18, 3 (1979), 247- 265.
46. K. Inoue and I. Takanami, Three-way two-dimensional aulticounter automata, Information Sciences 19, 1 (1979), 1-20.
47. K. Inoue and I. Takanami, Some properties of three-way two-dimensional multicounter automata over square tapes (in Japanese), IECE of Japan Trans.(D), October 1979, 673-680.
48. K. Inoue and I. Takanami, A note on deterministic three-way tape-bounded two-dimensional Turing machines, Information Sciences 20, 1 (1980), 41-55.
49. K. Inoue and I. Takanami, A note on decision problems for three-way two-dimensional finite ‘automata, Information Processing Letters 10, 5 (July 1980), 245-248.
50. K. Inoue, I. Takanami and J. Hromkovic, A leaf-size hierarchy of two- dimensional alternating Turing machines, Discrete Algorithms and Complexity, Academic Press (1987), 389-404.
51. K. Inoue, I. Takanami and A. Nakamura, A note on two-dimensional finite automata, Information Processing Letters 7, 1 (1978), 49-52.
52. K. Inoue, I. Takanami and A. Nakamura, Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure, Information Sciences 22, 1 (1980), 45- 50.
53. K. Inoue, I. Takanami and A. Nakamura, Connected pictures are not recognizable by deterministic two- dimensional on-line tessellation acceptors, Computer Vision, Graphics, and Image Processing 26 (1984), 126-129.
54. K. Inoue, I. Takanami and A. Nakamura, A note on time-bounded bottom-up pyramid cellular acceptors, To appear in Information Sciences.
55. K. Inoue, I. Takanami and H. Taniguchi, Three-way two-dimensional simple multihead finite automata -Hierarchical properties- (in Japanese), IECE of Japan Trans.(D), February 1979, 65-72.
56. K. Inoue, I. Takanami and H. Taniguchi, Three-way two-dimensional simple aultihead finite automata Closure properties- (in Japanese), IECE of Japan Trans.(D), April 1979, 273-280.
57. K. Inoue, I. Takanami and H. Taniguchi, The accepting powers of two-dimensional automata over square tapes (in Japanese), IECE of Japan Trans.(D), February 1980, 113-120.
58. K. Inoue, I. Takanami and H. Taniguchi,Two-dimensional alternating Turing machines, Theoretical Computer Science 27 (1983), 61-83.
59. A. Ito, k. Inoue, I. Takanami and H. Taniguchi, Two-dimensional alternating Turing machines with only universal states, Information and Control 55, 1-3 (1982), 193-221.
60. A. Ito, k. Inoue, I. Takanami and H. Taniguchi, A note on space complexity of nondeterministic two-dimensional Turing machines, IECE of Japan Trans.(E), August 1983, 508-509.
61. A. Ito, k. Inoue, I. Takanami and H. Taniguchi,Hierarchy of the accepting power of cellular space based on the number of state changes (in Japanese), IECE of Japan Trans.(D), September 1985, 1553-1561.
62. A. Ito, k. Inoue, I. Takanami and H. Taniguchi, Relationships of the accepting powers between cellular space with bounded number of state-changes and other automata (in Japanese), IECE of Japan Trans.(D), September 1985, 1562-1570.
63. A. Ito, k. Inoue, I. Takanami and H. Taniguchi, State-change bounded rectangular array cellular space acceptors with three-neighbor (in Japanese), IEICE of Japan Trans.(D), December 1987, 2339-2347.
64. A. Ito, K. Inoue and I. Takanami, A note on three-way two-dimensional alternating Turing machines, Information Sciences 45, 1 (1988), 1-22.
65. A. Ito, k. Inoue, I. Takanami and H. Taniguchi, Deterministic on-line tessellation acceptors are equivalent to two-way two-diaensional alternating finite automata through 180° rotations, to appear in Theoretical Computer Science.
66. A. Ito, k. Inoue, I. Takanami and H. Taniguchi, A relationship between one-dimensional bounded cellular acceptors and two-dimensional alternating finite automata, manuscript (1987).
67. A. Ito, k. Inoue, I. Takanami and H. Taniguchi, The simulation of two-dimensional one-marker automata by three-way two-dimensional Turing machines, to appear in the fifth International Meeting of Young Computer Scientists, November 14-18, 1988, Czechoslovakia.
68. A. Ito, k. Inoue, I. Takanami and H. Taniguchi, Some closure properties of the class of sets accepted by three-way two-dimensional alternating finite automata, submitted for publication.
69. K. Iwama, ASPACE(o(loglog n) is regular, Research Report, KSU/ICS, Institute of Computer Sciences, Kyoto Sangyo University, March 1986.
70. E.B. Kinber, Three-way automata on rectangular tapes over a one-letter alphabet, Information Sciences 35 (1985), 61-77.
71. S.R. Kosaraju, On some open problems in the theory of cellular automata, IEEE Trans, on Computers C-23, 6 (1974), 561-565.
72. S.R. Kosaraju, Fast parallel processing array algorithms for some graph problems, Proc. On Theoryf the 11th Annual ACM Symp. On Theoryn Theory of Coaputing (1979), 231- 236.
73. K. Krithivasan and R. Siromoney, Array automata and operations on array languages, Intern.J.Coaputer Math. 4-A (1974), 3-30.
74. R.E. Ladner, R.J. Lipton and L.J. Stockmeyer, Alternating pushdown automata, Proc. On Theoryf the 19th IEEE Symp. On Theoryn Foundations of Computer Science (1978), 92-106.
75. C. Meinel, The importance of plane labyrinths, EIK 18, 7/8 (1982), 419- 422.
76. D.L. Milgram and A. Rosenfeld, Array automata and array grammars, IFIP Congress 71 (1971), Booklet Ta2, 166-173.
77. D.L.Milgram, A region crossing problem for array-bounded automata, Information and Control 31 (1976), 147-152.
78. K. Morita, Computational complexity in one- and two-dimensional tape automata, Ph.D. Thesis, Osaka University, 1978.
79. K. Morita and K. Sugata, Three-way horizontally context-sensitive array grammars (in Japanese), Technical Report N0.AL8O-66, IECE of Japan (1981).
80. K. Morita, H. Umeo and K. Sugata, Computational complexity of L(m,n) tape-bounded two dimensional tape Turing machines (in Japanese), IECE of Japan Trans.(D), November 1977, 982-989.
81. K. Morita, H. Umeo and K. Sugata, Language recognition abilities of several two-dimensional tape automata and their relation to tape complexities (in Japanese), IECE of Japan Trans.(D), December 1977, 1077-1084.
82. K. Morita, H. limeo, H. Ebi and K. Sugata, Lower bounds on tape complexity of two-dimensional tape Turing machines (in Japanese), IECE of Japan Trans.(D), 1978, 381-386.
83. K. Morita, H. Umeo and K. Sugata, Accepting capability of ofi’side-free two-dimensional marker automata -the simulation of four-way automata by three-way tape-bounded Turing machines-(in Japanese), Technical Report No.AL79-2, IECE of Japan, 1979.
84. A. Nakamura and K. Aizawa, Acceptors for isometric parallel context-free array languages, Information Processing Letters 13, Nos4-5 (1981), 182-186.
85. A. Nakamura and C.R. Dyer, Bottom-up cellular pyramids for image analysis, Proc. On Theoryf the 4th Int.Joint Conf.Pattern Recognition, 1978.
86. K. Nakazono, K. Morita and K. Sugata, Accepting ability of linear time nondeterrainistic bottom-up pyramid cellular automata (in Japanese), IEICE of Trans.(D), February 1988, 458-461.
87. J. Pecht, T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-diaensional tessellation structures, Pattern Recognition 19, 4 (1986), 325-338.
88. A. Rosenfeld, Some notes on finite-state picture languages, Information and Control 31 (1976), 177-184.
89. A. Rosenfeld, Picture Languages (Formal Models for Picture Recognition), Academic Press, New York, 1977.
90. A. Rosenfeld and D.L. Milgram, Parallel/sequential array automata, Information Processing Letters 2 (1973), 43-46.
91. W.J. Savitch, Relationships between nondeterministic and deterministic tape complexities, JCSS 4 (1970), 177-192.
92. S. Seki, Real-time recognition of two-dimensional tapes by cellular automata, Information Sciences 19 (1979), 179-198.
93. S.M. Selkow, One-pass complexity of digital picture properties, J.Assoc.Comput.Math. 19(2) (1972), 283-295.
94. A.N. Shah, Pebble automata on arrays, Computer Graphics and Image Processing 3 (1974), 236-246.
95. A.N. Shah, Pushdown automata on arrays, Information Sciences 25 (1981), 175-193.
96. M. Sipser, Halting space-bounded computatiopns (Note), Theoretical Computer Science 10 (1980), 335-338.
97. R. Siromoney, Array languages and Lindenmayer systems -a survey, in‘The Book of L’ (eds. G.Rozenberg and A.Salomaa), Springer-Verlag, Berlin, 1985.
98. R. Siromoney, Advances in array languages, Lecture Notes in Computer Science 291 {Graph-Grammars and Their Application to Computer Science), Ehrig et al. (Eds.), 1987, 549-563.
99. R. Siromoney and G. Siroraoney, Extended controlled table L-arrays, Information and Control 35 (1977), 119-138.
100. A.R. Smith III, Two-dimensional formal languages and pattern recognition by cellular automata, Proc. On Theoryf the 12th Switching and Automata Theory (1971), 144-152.
101. A.R. Smith III, Real-time language recognition by one-dimensional cellular automata, JCSS 6 (1972), 233-253.
102. R.E. Stearns, J. Hartmanis and P.M. Lewis II, Hierarchies of memory limited computations, IEEE Conf.Rec.on Switching Circuit Theory and Logical Design (1965), 179-190.
103. R. Szelepcsenyi, The method of forcing for nondeterministic automata, submitted for publication.
104. A. Szepietowski, A finite 5-pebble automaton can search every maze, Information Processing Letters 15, 5 (December 1982), 199-204.
105. A. Szepietowski, There are no fully space constructible functions between loglog n and log n, Information Processing Letters 24, 6 (April 1987), 361-362.
106. A. Szepietowski, On three-way two-dimensional Turing machines, manuscript (1987).
107. H. Taniguchi, R. Inoue, I. Takanami and S. Seki, (k,1)-neighborhood template -type bounded cellular acceptors (in Japanese), IECE of Japan Trans.(D), March 1981, 244-251.
108. H. Taniguchi, R. Inoue, I. Takanami and S. Seki, (k,l)-neighborhood template -type bounded cellular acceptors refinements of hierarchical properties-(in Japanese), IECE of Japan Trans.(D), September 1983, 1062-1069.
109. H. Taniguchi, R. Inoue, I. Takanami and S. Seki, Relationship between the accepting powers of (k,1)-neighborhood template -type 1-dimensional bounded cellular acceptors and other types of 2-dinensional automata (in Japanese), IECE of Japan Trans.(D), October 1985, 1711-1718.
110. H. Taniguchi, R. Inoue, I. Takanami and S. Seki, Closure properties of (k,1) - neighborhood template -type 1- dioensional bounded cellular acceptors (in Japanese), IECE of Japan Trans.(D), March 1986, 279-290.
111. K. Taniguchi and T. Kasami, Some decision problems for two-dimensional nonwriting automata (in Japanese), IECE of Japan Trans.(C), 1971, 578- 585.
112. M. Toda, K. Inoue and I. Takanami, Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors, Theoretical Computer Science 24 (1983), 179-194.
113. H. Umeo, K. Morita and K. Sugata, Pattern recognition by automata on a two-dimensional tape, IECE of Japan Trans.(D), November 1976, 817-824.
114. R. Vollmar, On cellular automata with a finite number of State changes, Comput.Suppl. 3 (1981),181-191.
115. P.S.P. Wang, Finite-turn repetitive checking automata and sequential/parallel matrix languages, IEEE Trans, on Computers C-30, 5 (May 1981), 366-370.
116. Y. Yamamoto, K. Morita and K. Sugata, Space complexity for recognizing connectedness in three-dimensional patterns, IECE of Japan Trans.(E), 1981, 778-785.