论文信息 - Deterministic Two-Way One-Head Pushdown Automata are Very Powerful - 字舞流文

Deterministic Two-Way One-Head Pushdown Automata are Very Powerful

Abstract We show that if a language over a two-letter alphabet belongs to P , then its unary encoding belongs to 2DPDA(1).

Burkhard Monien

[1] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[2] Michael J. Fischer,et al. Separating Nondeterministic Time Complexity Classes , 1978, JACM.

[3] 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..

[4] Burkhard Monien. Characterizations of Time-Bounded Computations by Limited Primitive Recursion , 1974 .

[5] Burkhard Monien. Transformational methods and their application to complexity problems , 1976, Acta Informatica.

[6] Oscar H. Ibarra,et al. On Two-way Multihead Automata , 1973, J. Comput. Syst. Sci..

[7] Andrew Chi-Chih Yao,et al. K + 1 heads are better than K , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).