论文信息 - Reversals and Alternation

Reversals and Alternation

Auxiliary pushdown automata have been proven to be a useful tool for the characterization of complexity classes. In this paper we consider the pushdown reversal complexity of these machines, and show that especially in connection with a simultaneous space bound, pushdown reversals provide a uniform measure for the characterization of awide range of complexity classes, located between L and P. It is shown that classes defined by reversal bounds are included in those of restricted pushdown height.

Gerhard Buntrock | Albrecht Hoene

[1] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[2] Róbert Szelepcsényi. The moethod of focing for nondeterministic automata , 1987, Bull. EATCS.

[3] Walter L. Ruzzo. On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[4] Gerd Wechsung. The oscillation complexity and a hierarchy of context-free languages , 1979, FCT.

[5] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[6] Neil Immerman,et al. Nondeterministic space is closed under complementation , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[7] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[8] K. N. King. Measures of parallelism in alternating computation trees (Extended Abstract) , 1981, STOC '81.

[9] George Mager,et al. Writing Pushdown Acceptors , 1969, J. Comput. Syst. Sci..

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