论文信息 - Fooling Rebound Automata

Fooling Rebound Automata

We separate the class of languages accepted by deterministic two-way one counter automata from the languages accepted by two-dimensional rebound automata. We also discuss the relationship of the classes to languages accepted by rebound automata with fc-dimensional input for k ≥ 3. Further we answer the question whether the classes of languages accepted by deterministic or nondeterministic rebound automata are closed under length-preserving homomorphisms negatively.

Holger Petersen

[1] Zvi Galil,et al. Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines , 1982, Theor. Comput. Sci..

[2] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[3] M. Blum,et al. Automata on a 2-Dimensional Tape , 1967, SWAT.

[4] Burkhard Monien. Two-Way Multihead Automata Over a One-Letter Alphabet , 1980, RAIRO Theor. Informatics Appl..

[5] Katsushi Inoue,et al. Alternating Rebound Turing Machines (Special Section on Discrete Mathematics and Its Applications) , 1999 .

[6] Katsushi Inoue,et al. A survey of two-dimensional automata theory , 1991, Inf. Sci..

[7] I. Takanami,et al. A two-way nondetereministic one-counter languages not accepted by nondeterministic rebound automata , 1990 .

[8] Holger Petersen. Two-way one-counter automata accepting bounded languages , 1994, SIGA.

[9] Juraj Hromkovic,et al. Communication Complexity and Sequential Compuation , 1997, MFCS.