Separation results for rebound automata

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

Volumn 1893, Issue , 2000, Pages 589-598

  Petersen, Holger ^a,b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; SEPARATION;

COUNTER AUTOMATA;

CONTEXT FREE LANGUAGES;

EID: 23044520256     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_54     Document Type: Conference Paper

References (13)

1. M. Blum and C. Hewitt. Automata on a 2-dimensional tape. In Proceedings of the 8th Annual Symposium on Switching and Automata Theory, Austin, 1967, pages 155-160, 1967.
2. M. Chrobak. Variations on the technique of Duris and Galil. Journal of Computer and System Sciences, 30:77-85, 1985.
3. P. Duris and Z. Galil. Fooling a two way automaton or one pushdown store is better than one counter for two way machines. Theoretical Computer Science, 21:39-53, 1982.
4. P. C. Fischer, A. R. Meyer, and A. L. Rosenberg. Counter machines and counter languages. Mathematical Systems Theory, 2:265-283, 1968.
5. K. Inoue and I. Takanami. A survey of two-dimensional automata theory. Information Sciences, 55:99-121, 1991.
6. K. Inoue, I. Takanami, and H. Taniguchi. A note on rebound automata. Information Sciences, 26:87-93, 1982.
7. K. Morita, K. Sugata, and H. Umeo. Computation complexity of n-bounded counter automaton and multidimensional rebound automaton. Systems • Computers • Controls, 8:80-87, 1977. Translated from Denshi Tsushin Gakkai Ronbunshi (IECE of Japan Trans.) 60-D:283-290, 1977 (Japanese).
8. K. Morita, K. Sugata, and H. Umeo. Computational complexity of n-bounded counter automaton and multi-dimensional rebound automaton. IECE of Japan Trans., 60-E:226-227, 1977. Abstract of [7].
9. H. Petersen. Fooling rebound automata. In M. Kutylowski, L. Pacholski, and T. Wierzbicki, editors, Proceedings of the 24th Symposium on Mathematical Foundations of Computer Science (MFCS), Szklarska Poreba, 1999, number 1672 in Lecture Notes in Computer Science, pages 241-250, Berlin-Heidelberg-New York, 1999. Springer.
10. A. Rosenfeld. Picture Languages. Academic Press, New York, 1979.
11. M. Sakamoto, K. Inoue, and I. Takanami. A two-way nondeterministic one-counter language not accepted by nondeterministic rebound automata. IECE of Japan Trans., 73-E:879-881, 1990.
12. K. Sugata, H. Umeo, and K. Morita. The language accepted by a rebound automaton and its computing ability. Electronics and Communications in Japan, 60-A:11-18, 1977.
13. L. Zhang, T. Okozaki, K. Inoue, A. Ito, and Y. Wang. A note on probabilistic rebound automata. IEICE Trans. Inf. & Syst., E81-D:1045-1052, 1998.