A reducibility for the dot-depth hierarchy

Theoretical Computer Science

Volumn 345, Issue 2-3, 2005, Pages 448-472

  Selivanov, Victor L ^a   Wagner, Klaus W ^b  

^a A P ERSHOV INSTITUTE OF INFORMATICS SYSTEMS   (Russian Federation)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Complete sets; Degree structure; Dot depth hierarchy; Leaf languages; Reducibility

Indexed keywords

COMPLETE SETS; COMPLEXITY THEORY; COMPUTABILITY THEORY; DEGREE STRUCTURE; DOT-DEPTH HIERARCHY; LEAF LANGUAGES; REDUCIBILITY;

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; SET THEORY;

COMPUTABILITY AND DECIDABILITY;

EID: 27644454761     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.020     Document Type: Conference Paper

References (36)

1. J.L. Balcázar, J. Díaz, J. Gabarró, Structural complexity I, EATCS Monographs on Theoretical Computer Science, Vol. 11, Springer, Berlin, 1988.
2. J.L. Balcázar, J. Díaz, J. Gabarró, Structural complexity II, EATCS Monographs on Theoretical Computer Science, Vol. 11, Springer, Berlin, 1990.
3. B. Borchert, D. Kuske, and F. Stephan On existentially first-order definable languages and their relation to NP Theoret. Inform. Appl. 33 1999 259 269
4. D.P. Bovet, P. Crescenzi, and R. Silvestri A uniform approach to define complexity classes Theoret. Comput. Sci. 104 1992 263 283
5. J.A. Brzozowski, and R. Knast The dot-depth hierarchy of star-free languages is infinite J. Comput. System Sci. 16 1978 37 55
6. J.R. Büchi Weak second-order arithmetic and finite automata Z. Math. Logic Grundl. Math. 6 1960 66 92
7. H.-J. Burtschick, and H. Vollmer Lindström quatifiers and leaf language definability Internat. J. of Found. Comput. Sci. 9 1998 277 294
8. R.S. Cohen, and J.A. Brzozowski Dot-depth of star-free events J. Comput. System Sci. 5 1971 1 16
9. K. Cronauer, U. Hertrampf, H. Vollmer, and K.W. Wagner The chain method to separate counting classes Theory Comput. Systems 31 1998 93 108
10. H.-D. Ebbinghaus, and J. Flum Finite Model Theory 1999 Springer Berlin
11. C.C. Elgot Decision problems of finite automata design and related arithmetics Trans. Amer. Math. Soc. 98 1961 21 52
12. C. Glaßer, and H. Schmitz The Boolean structure of dot-depth one J. Automat, Languages Combin. 6 2001 437 452
13. T. Gundermann, N.A. Nasser, and G. Wechsung A survey on counting classes Proc. of Structures in Complexity Theory 1990 140 153
14. T. Gundermann, and G. Wechsung Counting classes of finite accepting types Computers and Artificial Intelligence 6 1987 395 409
15. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K.W. Wagner, On the power of polynomial time bit-reductions, in: Proc. of 8th Structure in Complexity Theory (1993) 200-207.
16. U. Hertrampf, H. Vollmer, K. W. Wagner, On the power of number-theoretic operations with respect to counting, in: Proc. of 10th Structure in Complexity Theory (1995) 299-314.
17. U. Hertrampf, H. Vollmer, and K.W. Wagner On balanced vs. unbalanced computation trees Math. Systems Theory 29 1996 411 421
18. N. Immermann Descriptive Complexity 1999 Springer Berlin
19. B. Jenner, P. McKenzie, and D. Therien Logspace and logtime leaf languages Inform. and Computa. 129 1996 21 33
20. R. McNaughton, and S. Papert Counter-free automata 1971 MIT Press Cambridge, MA
21. J.-E. Pin, and P. Weil Polynomial closure and unambiguous product Theory Comput. Systems 30 1997 383 422
22. H. Schmitz, K.W. Wagner, The Boolean hierarchy over level 1/2 of the Sraubing-Therien hierarchy, Technical Report 201, Institute für Informatik, University of Würzburg, http://www.informatik.uni-wuerzburg.de.
23. V.L. Selivanov Hierarchies of the hyperarithmetical sets and functions Algebra and Logic 22 N6 1983 666 692 (Russian, there is an English translation)
24. V.L. Selivanov, Two refinements of the polynomial hierarchy, in: Proc. 11th Symp. on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, Vol. 775, Springer, Berlin 1994, pp. 439-448.
25. V.L. Selivanov Fine hierarchies and Boolean terms J. Symbolic Logic 60 1995 289 317
26. V.L. Selivanov. A logical approach to decidability of hierarchies of regular star-free languages. in: Proc. 18th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 2010, Springer, Berlin, 2001, pp. 539-550.
27. V.L. Selivanov Relating automata-theoretic hierarchies to complexity-theoretic hierarchies Theoret. Inform. Appl. 36 2002 29 42
28. V.L. Selivanov, A.G. Shukin, On hierarchies of regular star-free languages, Preprint 69, A.P. Ershov Institute of Informatics Systems, 2000, 28p, (in Russian).
29. V.L. Selivanov, K.W. Wagner, A reducibility for the dot-depth hierarchy, Lecture Notes in Computer Science, Vol. 3153, 2004, pp. 783-793.
30. J. Shoenfield Mathematical Logic 1967 Addison-Wesley Reading, MA
31. A.G. Shukin Difference hierarchies of regular languages Comput. Systems, Novosibirsk 161 1998 141 155 (in Russian)
32. W. Thomas Classifying regular events in symbolic logic J. Comput. System Sci. 25 1982 360 376
33. W. Thomas, A concatenation game and the dot-depth hierarchy. Lecture Notes in Computer Science, Vol. 270, 1987, pp. 415-426.
34. N.K. Vereshchagin Relativizable and non-relativizable theorems in the polynomial theory of algorithms Izv. Rossiiskoi Akad Nauk 57 1993 51 90 (in Russian)
35. K.W. Wagner A note on parallel queries and the symmetric-difference hierarchy Inform. Process. Lett. 66 1998 13 20
36. G. Wechsung, K.W. Wagner, On the Boolean closure of NP, in: Proc. of the 1985 Int. Conf. on Fundamentals of Computation theory, Lecture Notes in Computer Science, Vol. 199, Springer-Verlag, 1985, p. 485-493.