Name
Abstract | ||
|---|---|---|
We define alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal quantifiers alternate. Alternation links up time and space complexities rather well, in that alternating polynomial time equals deterministic polynomial space, and alternating linear space equals deterministic exponential time. Such considerations lead to a two-person game complete in polynomial time, and other games complete in exponential time. We also find that computability on a parallel processing machine is a rather rugged notion, and present two parallel processing models that are polynomially equivalent in their running times. We also show that while n-state alternating finite automata accept only regular sets that can be accepted by 22n-O(logn) state deterministic automata, alternating pushdown automata accept all languages accepted by Turing machines in deterministic exponential time. |
Year | DOI | Venue |
|---|---|---|
1976 | 10.1109/SFCS.1976.4 | FOCS |
Keywords | DocType | Citations |
Turing machine,state deterministic automaton,Turing Machines,exponential time,nondeterministic Turing Machines,polynomial time,deterministic polynomial space,space complexity,linear space,deterministic exponential time | Conference | 134 |
PageRank | References | Authors |
42.23 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ashok K. Chandra | 1 | 3116 | 1215.02 |
| Larry J. Stockmeyer | 2 | 4333 | 1077.31 |