Skip to main content
SpringerLink
Log in

Fine Hierarchy of Regular Aperiodic ω-Languages

  • Conference paper
Developments in Language Theory (DLT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4588))

Included in the following conference series:

Abstract

We develop a theory of regular aperiodic ω-languages in parallel with the theory around the Wagner hierarchy. In particular, we characterize the Wadge degrees of regular aperiodic ω-languages, find an effective version of the Wadge reducibility adequate for this class of languages and prove “aperiodic analogs” of the Büchi-Landweber determinacy theorem and of Landweber’s description of regular open and regular G δ sets.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc. 138, 295–311 (1969)

    Article  MathSciNet  Google Scholar 

  2. Carton, O.: Wreath product and infinite words. J. Pure and Applied Algebra 153, 129–150 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Carton, O., Perrin, D.: Chains and superchains for ω-rational sets, automata and semigroups. International Journal of Algebra and Computation 7(7), 673–695 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Carton, O., Perrin, D.: The Wagner hierarchy of ω-rational sets. International Journal of Algebra and Computation 9(7), 673–695 (1999)

    MathSciNet  Google Scholar 

  5. Duparc, J.: A hierarchy of deterministic context-free ω-languages. Theoretical Computer Science 290(3), 1253–1300 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Duparc, J., Riss, M.: The missing link for ω-rational sets, automata, and semigroups. International Journal of Algebra and Computation 16(1), 161–185 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kechris, A.S.: Classical Descriptive Set Theory. Springer, Berlin Heidelberg (1994)

    Google Scholar 

  8. McNaughton, R., Papert, S.: Counter-free automata. MIT Press, Cambridge, Massachusets (1971)

    MATH  Google Scholar 

  9. Murlak, F.: The Wadge hierarchy of deterministic tree languages. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 408–419. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Perrin, D., Pin, J.-E.: Infinite Words. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)

    Google Scholar 

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

  12. Selivanov, V.L.: Fine hierarchy of regular ω-languages. Preprint N 14, the University of Heidelberg, Chair of Mathematical Logic, p. 13 (1994)

    Google Scholar 

  13. Selivanov, V.L.: Fine hierarchy of regular ω-languages. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 277–287. Springer, Heidelberg (1995)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Selivanov, V.L.: Fine hierarchy of regular ω-languages. Theoretical Computer Science 191, 37–59 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Selivanov, V.L.: Wadge degrees of ω-languages of deterministic Turing machines. Theoretical Informatics and Applications 37, 67–83 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Selivanov, V.L.: Fine hierarchy of regular aperiodic ω-languages. Technical report No 390, Institute of Informatics, University of Würzburg, p. 21 (2006)

    Google Scholar 

  18. Staiger, L.: ω-Languages. In: Handbook of Formal Languages, vol. 3, pp. 339–387. Springer, Berlin Heidelberg (1997)

    Google Scholar 

  19. Staiger, L., Wagner, K.: Automatentheoretische und automatenfreie Characterisierungen topologischer klassen regulärer Folgenmengen. Elektron.Inf. verarb. Kybern. EIK 10(7), 379–392 (1974)

    MATH  MathSciNet  Google Scholar 

  20. Thomas, W.: Star-free regular sets of ω-sequences. Information and Control 42, 148–156 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  21. Thomas, W.: Automata on infinite objects. Handbook of Theoretical Computer Science B, 133–191 (1990)

    Google Scholar 

  22. Thomas, W.: Languages, automata and logic. Handbook of Formal Language theory B, 133–191 (1996)

    Google Scholar 

  23. Trakhtenbrot, B.A., Barzdin, J.M.: Finite automata. Behaviour and Synthesis (Russian, English translation 1973), Mir, Moscow. North Holland, Amsterdam (1970)

    Google Scholar 

  24. Wagner, K.: On ω-regular sets. Information and Control 43, 123–177 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P.Ershov Institute of Informatics Systems, Siberian Division Russian Academy of Sciences, and, Theoretische Informatik, Universität Würzburg,  

    Victor L. Selivanov

Authors
  1. Victor L. Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tero Harju Juhani Karhumäki Arto Lepistö

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Selivanov, V.L. (2007). Fine Hierarchy of Regular Aperiodic ω-Languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73208-2_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73207-5

  • Online ISBN: 978-3-540-73208-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation