论文信息 - On the Determinacy Problem for Two-Way Pushdown Automata

On the Determinacy Problem for Two-Way Pushdown Automata

Abstract We show that determinacy of two-way pushdown automata languages is decidable exactly if deterministic and non-deterministic two-way pushdown automata are equivalent.

Holger Petersen

[1] H. Petersen,et al. Notes on Looping Deterministic Two-Way Pushdown Automata , 1994, Inf. Process. Lett..

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

[3] Oscar H. Ibarra,et al. Two-Way Pushdown Automata , 1967, Inf. Control..

[4] Marek Chrobak. Variations on the Technique of Duris and Galil , 1985, J. Comput. Syst. Sci..