A reducibility for the dot-depth hierarchy

Authors:
Victor L. Selivanov;Klaus W. Wagner
Affiliations:
A.P. Ershow Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences, Russia;Institut für Informatik, Julius-Maximilians-Universität, Würzburg
Venue:
Theoretical Computer Science - Mathematical foundations of computer science 2004
Year:
2005

Citing 13
Cited 3

A concatenation game and the dot-depth hierarchy

Computation theory and logic
Counting classes with finite acceptance types

Computers and Artificial Intelligence
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
Logspace and logtime leaf languages

Information and Computation
A note on parallel queries and the symmetric-difference hierarchy

Information Processing Letters
The Boolean structure of dot-depth one

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Two Refinements of the Polynomial Hierarcht

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

FCT '85 Fundamentals of Computation Theory
On the power of number-theoretic operations with respect to counting

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Counter-Free Automata (M.I.T. research monograph no. 65)

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

Languages polylog-time reducible to dot-depth 1/2

Journal of Computer and System Sciences
Fine hierarchies and m-reducibilities in theoretical computer science

Theoretical Computer Science
The dot-depth and the polynomial hierarchy correspond on the delta levels

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hierarchies considered in computability theory and in complexity theory are related to some reducibilities in the sense that levels of the hierarchies are downward closed and have complete sets. In this paper we propose a reducibility having similar relationship to the Brzozowski's dot-depth hierarchy and some its refinements. We prove some basic facts on the corresponding degree structure and discuss relationships of the reducibility to complexity theory (via the leaf-language approach).