RAIRO-Theor. Inf. Appl.
Volume 36, Number 1, January/March 2002
|Page(s)||29 - 42|
|Published online||15 December 2002|
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
Novosibirsk Pedagogical University,
28 Vilyniskaya Str., Novosibirsk 630126, Russia; email@example.com.
Accepted: 14 June 2002
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.
Mathematics Subject Classification: 03D05 / 03D15 / 03D55
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.