A reducibility for the dot-depth hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 783-793

  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

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

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

COMPUTATIONAL COMPLEXITY;

EID: 35048858043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_61     Document Type: Article

References (29)

1. B. Borchert, D. Kuske and F. Stephan. On existentially first-order definable languages and their relation to NP. Theor. Informatics Appl., 33 (1999), 259-269.
2. D.P. Bovet, P. Crescenzi and R. Silvestri. A uniform approach to define complexity classes. Theoret. Comp. Sci, 104 (1992), 263-283.
3. J.A. Brzozowski and R. Knast. The dot-depth hierarchy of star-free languages is infinite. J. Comp. Systems Sci., 16 (1978), 37-55.
4. J.R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logic Grundl. Math., 6 (1960), 66-92.
5. R.S. Cohen and J.A. Brzozowski. Dot-depth of star-free events. J. Comp. Systems Sci. 5 (1971), 1-16.
6. K. Cronauer, U. Hertrampf, H. Vollmer and K.W. Wagner. The chain method to separate counting classes. Theory Comput. Systems, 31 (1998), 93-108.
7. H.-D. Ebinghaus and J. Flum. Finite Model Theory, Berlin, Springer, 1999.
8. C. Glaßer amd H. Schmitz. The Boolean Structure of Dot-Depth One. J. of Automata, Languages and Combinatorics, 6 (2001), 437-452.
9. T. Gundermann and G. Wechsung. Counting classes of finite accepting types. Computers and artificial intelligence, 6 (1987), 395-409.
10. T. Gundermann, N.A. Nasser and G. Wechsung. A survey on counting classes. Proc. of Structures in Complexity Theory (1990), 140-153.
11. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer and K.W. Wagner. On the power of polynomial time bit-reductions, Proc. 8th Structure in Complexity Theory, 1993, 200-207.
12. U. Hertrampf, H. Vollmer and K.W. Wagner. On balanced vs. unbalanced computation trees, Math. Systems Theory 29 (1996), 411-421.
13. N. Immermann. Descriptive Complexity. Berlin, Springer, 1999.
14. R. McNaughton and S. Papert. Counter-free automata. MIT Press, Cambridge, Massachussets, 1971.
15. J.-E. Pin and P. Weil. Polynomial closure and unambiguous product. Theory of Computing Systems, 30 (1997), 383-422.
16. V.L. Selivanov. Two refinements of the polynomial hierarchy. Lecture Notes in Computer Science, v. 775. Springer, Berlin 1994, p. 439-448.
17. V.L. Selivanov. Fine hierarchies and Boolean terms. J. Symbolic Logic, 60 (1995), 289-317.
18. V.L. Selivanov. A logical approach to decidability of hierarchies of regular star-free languages. Lecture Notes in Computer Science, v. 2010. Berlin, Springer, 2001, 539-550
19. V.L. Selivanov. Relating automata-theoretic hierarchies to complexity-theoretic hierarchies. Theoret. Informatics Appl., 36 (2002), 29-42.
20. J. Shoenfield. Mathematical Logic, Addison Wesley, Massachussets, 1967.
21. A.G. Shukin. Difference hierarchies of regular languages. Comp. Systems, Novosibirsk, 161 (1998), 141-155 (in Russian).
22. V.L. Selivanov and A.G. Shukin. On hierarchies of regular star-free languages (in Russian). Preprint 69 of A.P. Ershov Institute of Informatics Systems, 2000, 28 p.
23. H. Schmitz and K.W. Wagner. The Boolean hierarchy over level 1/2 of the Sraubing-Therien hierarchy, Technical Report 201, Inst. für Informatik, Univ. Würzburg, http://www.informatik.uni-wuerzburg.de.
24. W. Thomas. Classifying regular events in symbolic logic. J. Comp. and Syst. Sci., 25 (1982), 360-376.
25. W. Thomas. A concatenation game and the dot-depth hierarchy. Lecture Notes in Computer Science, v. 270 (1987), 415-426.
26. N.K. Vereshchagin. Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestiya Rossiiskoi Akademii Nauk, 57 (1993), 51-90 (in Russian).
27. K.W. Wagner. A note on parallel queries and the symmetric-difference hierarchy. Information Processing Letters 66 (1998), 13-20.
28. G. Wechsung and K.W. Wagner. On the Boolean closure of NP, Manuskript.
29. Extended abstract as: G. Wechsung, On the Boolean closure of NP, Proceedings of the 1985 Int. Conf. on Fundamentals of Computation theory, v.199 of Lecture Notes in Computer Science, p.485-493. Springer-Verlag, 1985.