Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies

Authors:
Victor L. Selivanov
Affiliations:
-
Venue:
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Year:
2001

Citing 9
Cited 1

First-order logic and star-free sets

Journal of Computer and System Sciences
Structural complexity 1

Structural complexity 1
Structural complexity 2

Structural complexity 2
A uniform approach to define complexity classes

Theoretical Computer Science
Fine hierarchies and Boolean terms

Journal of Symbolic Logic
Two Refinements of the Polynomial Hierarcht

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Boolean closure of NP

FCT '85 Fundamentals of Computation Theory
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)

Leaf language classes

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Quantified Score

Hi-index	0.00

Visualization

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 H.-J. Burtschik and H. Vollmer on relationship between the Straubingand the polynomial hierarchies. In particular, this applies to the boolean hierarchy and the plus-hierarchy.