Alternating Pushdown Automata (Preliminary Report)

Alternation is a generalization of nondeterminism in which existential and universal quantitiers can alternate during the course of a computation, whereas in a nondeterministic computation there are only existential quantifiers. Alternating Turing machines are defined and shown to accept precisely the recursively enumerable sets. Complexity classes of languages accepted by time(space-) bounded alternating Turing machines are characterized in terms of complexity classes of languages accepted by space(time-) bounded deterministic Turing machines. In particular, alternating polynomial time is equivalent to deterministic polynomial space and alternating polynomial space is equivalent to deterministic 'exponential time. Subrecursive quantifier hierarchies are defined in terms of timeor space-bounded alternating Tufing machines by bounding the number of alternations allowed during computations. Alternating finite-state automata are defined and shown to accept only regular languages, although, in general, 2 2 states are necessary and sufficient to simulate a k-state alternating finite automaton deterministically. Finally, it is shown that alternating pushdown automata are strictly more powerful than nondeterministic pushdown automata.

[1]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[2]  John C. Shepherdson,et al.  The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

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

[4]  Dexter Kozen,et al.  Complexity of Boolean Algebras , 1980, Theor. Comput. Sci..

[5]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[6]  Oscar H. Ibarra,et al.  Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata , 1971, J. Comput. Syst. Sci..

[7]  Dexter Kozen,et al.  On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[8]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[9]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[10]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[11]  Journal of the Association for Computing Machinery , 1961, Nature.

[12]  Walter Lawrence Ruzzo.  General context-free language recognition. , 1978 .

[13]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[14]  G. Markowsky,et al.  On Dedekind’s problem: the number of isotone Boolean functions. II , 1975 .

[15]  Harry B. Hunt,et al.  The LBA Problem and its Importance in the Theory of Computing , 1973 .

[16]  Richard E. Ladner,et al.  Propositional modal logic of programs , 1977, STOC '77.

[17]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[18]  Larry J. Stockmeyer,et al.  A characterization of the power of vector machines , 1974, STOC '74.

[19]  Jeffrey D. Ullman,et al.  Nonerasing Stack Automata , 1967, J. Comput. Syst. Sci..

[20]  Shigeki Iwata,et al.  Classes of pebble games and complete problems , 1979, ACM '78.

[21]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[22]  Larry J. Stockmeyer,et al.  Provably Difficult Combinatorial Games , 1979, SIAM J. Comput..

[23]  Seymour Ginsburg,et al.  Stack automata and compiling , 1967, JACM.

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

[25]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[26]  Leonard Berman,et al.  Precise bounds for presburger arithmetic and the reals with addition: Preliminary report , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[27]  Juris Hartmanis,et al.  On the Power of Multiplication in Random Access Machines , 1974, SWAT.

[28]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[29]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[30]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .