Article contents
Relating Automata-theoretic Hierarchies to Complexity-theoreticHierarchies
Published online by Cambridge University Press: 15 December 2002
Abstract
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynomial-time hierarchy. This extends a result of Burtschik and Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the Boolean hierarchy and the plus-hierarchy.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2002
References
- 8
- Cited by