Skip to main content
SpringerLink
Log in

Complexity of Topological Properties of Regular ω-Languages

  • Conference paper
Developments in Language Theory (DLT 2008)

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

Included in the following conference series:

  • 692 Accesses

Abstract

We determine the complexity of topological properties of regular ω-languages (i.e., classes of ω-languages closed under inverse continuous functions). We show that they are typically NL-complete (PSPACE-complete) for the deterministic Muller, Mostowski and Büchi automata (respectively, for the nondeterministic Rabin, Muller, Mostowski and Büchi automata). For the deterministic Rabin and Streett automata and for the nondeterministic Streett automata upper and lower complexity bounds for the topological properties are established.

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. Balcazar, J.L., Diaz, J., Gabarro, J.: Structural Complextiy I. Springer, Heidelberg (1995)

    Google Scholar 

  2. Cabessa, J.: A Game Theoretic Approach to the Algebraic Counterpart of the Wagner Hierarchy. PhD Thesis, Universities of Lausanne and Paris-7 (2007)

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

  6. Krishnan, S., Puri, A., Brayton, R.: Structural complexity of ω-automata. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 143–156. Springer, Heidelberg (1995)

    Google Scholar 

  7. Landweber, L.H.: Decision problems for ω-automata. Math. Systems Theory 4, 376–384 (1969)

    Article  MathSciNet  Google Scholar 

  8. Löding, C.: Optimal bounds for the transformation of omega-automata. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 97–109. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Meyer, A., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential time. In: Proc. of the 13th IEEE Symp. on Switching and Automata Theory 1972, pp. 125–129 (1972)

    Google Scholar 

  10. Pin, J.-E.: Syntactic semigroups. In: Handbook of Formal Languages, pp. 679–746. Springer, Heidelberg (1997)

    Google Scholar 

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

    MATH  Google Scholar 

  12. Safra, S.: On the complexity of ω-automata. In: Proc. of the 29th IEEE FOCS 1988, pp. 319–327 (1988)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science 49, 217–237 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  15. Staiger, L., Wagner, K.: Automatentheoretische und automatenfreie Characterisierungen topologischer Klassen regulärer Folgenmengen. Elektronische Informationsverarbeitung und Kybernetik 10, 379–392 (1974)

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  17. Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133–191. Elsevier, Amsterdam (1990)

    Google Scholar 

  18. Thomas, W.: Languages, automata and logic. In: Handbook of Formal Languages, vol. 3, pp. 133–191. Springer, Heidelberg (1997)

    Google Scholar 

  19. Wadge, W.: Degrees of complexity of subsets of the Baire space. Notices AMS 19, 714–715 (1972)

    Google Scholar 

  20. Wadge, W.: Reducibility and determinateness in the Baire space. PhD thesis, University of California, Berkely (1984)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. Wilke, T.: An algebraic theory for for regular languages of finite and infinite words. Int. J. Alg. Comput. 3, 447–489 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  23. Wechsung, G.: On the Boolean closure of NP. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 485–493. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  24. Wilke, T., Yoo, H.: Computing the Wadge degree, the Lipschitz degree, and the Rabin index of a regular language of infinite words in polynomial time. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 288–302. Springer, Heidelberg (1995)

    Google Scholar 

  25. Yan, Q.: Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 589–600. Springer, Heidelberg (2006)

    Chapter  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

Masami Ito Masafumi Toyama

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Selivanov, V.L., Wagner, K.W. (2008). Complexity of Topological Properties of Regular ω-Languages. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85780-8_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85779-2

  • Online ISBN: 978-3-540-85780-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation