No CrossRef data available.
Article contents
A Space Lower Bound for Acceptance by One-Way Π2-Alternating Machines
Published online by Cambridge University Press: 15 April 2002
Abstract
We show that one-way Π2-alternating Turing machines cannot accept unary nonregular languages in o(log n) space. This holds for an accept mode of space complexity measure, defined as the worst cost of any accepting computation. This lower bound should be compared with the corresponding bound for one-way Σ2-alternating machines, that are able to accept unary nonregular languages in space O(log log n). Thus, Σ2-alternation is more powerful than Π2-alternation for space bounded one-way machines with unary inputs.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 5 , September 2000 , pp. 357 - 372
- Copyright
- © EDP Sciences, 2000