Skip to main content
SpringerLink
Log in

A Reducibility for the Dot-Depth Hierarchy

  • Conference paper
Mathematical Foundations of Computer Science 2004 (MFCS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3153))

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Borchert, B., Kuske, D., Stephan, F.: On existentially first–order definable languages and their relation to NP. Theor. Informatics Appl. 33, 259–269 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bovet, D.P., Crescenzi, P., Silvestri, R.: A uniform approach to define complexity classes. Theoret. Comp. Sci. 104, 263–283 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star–free languages is infinite. J. Comp. Systems Sci. 16, 37–55 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  4. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logic Grundl. Math. 6, 66–92 (1960)

    Article  MATH  Google Scholar 

  5. Cohen, R.S., Brzozowski, J.A.: Dot-depth of star-free events. J. Comp. Systems Sci. 5, 1–16 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cronauer, K., Hertrampf, U., Vollmer, H., Wagner, K.W.: The chain method to separate counting classes. Theory Comput. Systems 31, 93–108 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ebinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Berlin (1999)

    Google Scholar 

  8. Glaßer, C., Schmitz, H.: The Boolean Structure of Dot-Depth One. J. of Automata, Languages and Combinatorics 6, 437–452 (2001)

    MATH  Google Scholar 

  9. Gundermann, T., Wechsung, G.: Counting classes of finite accepting types. Computers and artificial intelligence 6, 395–409 (1987)

    MATH  MathSciNet  Google Scholar 

  10. Gundermann, T., Nasser, N.A., Wechsung, G.: A survey on counting classes. In: Proc. of Structures in Complexity Theory, pp. 140–153 (1990)

    Google Scholar 

  11. Hertrampf, U., Lautemann, C., Schwentick, T., Vollmer, H., Wagner, K.W.: On the power of polynomial time bit-reductions. In: Proc. 8th Structure in Complexity Theory, pp. 200–207 (1993)

    Google Scholar 

  12. Hertrampf, U., Vollmer, H., Wagner, K.W.: On balanced vs. unbalanced computation trees. Math. Systems Theory 29, 411–421 (1996)

    MATH  MathSciNet  Google Scholar 

  13. Immermann, N.: Descriptive Complexity. Springer, Berlin (1999)

    Google Scholar 

  14. McNaughton, R., Papert, S.: Counter–free automata. MIT Press, Cambridge (1971)

    MATH  Google Scholar 

  15. Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory of Computing Systems 30, 383–422 (1997)

    MATH  MathSciNet  Google Scholar 

  16. Selivanov, V.L.: Two refinements of the polynomial hierarchy. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 439–448. Springer, Heidelberg (1994)

    Google Scholar 

  17. Selivanov, V.L.: Fine hierarchies and Boolean terms. J. Symbolic Logic 60, 289–317 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  18. Selivanov, V.L.: A logical approach to decidability of hierarchies of regular star-free languages. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 539–550. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Selivanov, V.L.: Relating automata-theoretic hierarchies to complexity-theoretic hierarchies. Theoret. Informatics Appl. 36, 29–42 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  20. Shoenfield, J.: Mathematical Logic. Addison Wesley, Massachussets (1967)

    MATH  Google Scholar 

  21. Shukin, A.G.: Difference hierarchies of regular languages. Comp. Systems, Novosibirsk 161, 141–155 (1998) (in Russian)

    Google Scholar 

  22. Selivanov, V.L., Shukin, A.G.: On hierarchies of regular star-free languages (in Russian), Preprint 69 of A.P. Ershov Institute of Informatics Systems, p. 28 (2000)

    Google Scholar 

  23. Schmitz, H., Wagner, K.W.: 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. Thomas, W.: Classifying regular events in symbolic logic. J. Comp. and Syst. Sci 25, 360–376 (1982)

    Article  MATH  Google Scholar 

  25. Thomas, W.: A concatenation game and the dot-depth hierarchy. In: Börger, E. (ed.) Computation Theory and Logic. LNCS, vol. 270, pp. 415–426. Springer, Heidelberg (1987)

    Google Scholar 

  26. Vereshchagin, N.K.: Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestiya Rossiiskoi Akademii Nauk 57, 51–90 (1993) (in Russian)

    Google Scholar 

  27. Wagner, K.W.: A note on parallel queries and the symmetric-difference hierarchy. Information Processing Letters 66, 13–20 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  28. Wechsung, G., Wagner, K.W.: On the Boolean closure of NP, Manuskript, Extended abstract as: Wechsung, G.: On the Boolean closure of NP. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 485–493. Springer, Heidelberg (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siberian Division of the Russian Academy of Sciences, A.P. Ershov Institute of Informatics Systems,  

    Victor L. Selivanov

  2. Institut für Informatik, Julius-Maximilians-Universität Würzburg,  

    Klaus W. Wagner

Authors
  1. Victor L. Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus W. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 118 00, Praha1, Czech Republic

    Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Selivanov, V.L., Wagner, K.W. (2004). A Reducibility for the Dot-Depth Hierarchy. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28629-5_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22823-3

  • Online ISBN: 978-3-540-28629-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation