Abstract
The leaf-language mechanism associates a complexity class to a class of regular languages. It is well-known that the Σκ- and Πκ-levels of the dot-depth hierarchy and the polynomial hierarchy correspond in this formalism. We extend this correspondence to the Δκ-levels of these hierarchies: LeafP(Δ κL) = ΔκΡ. These results are obtained in part by relating operators on varieties of languages to operators on the corresponding complexity classes. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Borchert, B., Lange, K. J., Stephan, F., Tesson, P., & Thérien, D. (2004). The dot-depth and the polynomial hierarchy correspond on the delta levels. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3340, 89–101. https://doi.org/10.1007/978-3-540-30550-7_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
