Skip to main content
SpringerLink
Log in

Complexity of Aperiodicity for Topological Properties of Regular ω-Languages

  • Conference paper
Logic and Theory of Algorithms (CiE 2008)

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

Included in the following conference series:

  • 1028 Accesses

Abstract

We study the complexity of aperiodicity restricted to topological properties of regular ω-languages (i.e. properties closed under the Wadge equivalence on the Cantor space of ω-words) restricted to aperiodic sets. In particular, we show the -completeness of such problems for several usual deterministic and non-deterministic automata representations of regular ω-languages.

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. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logic Grundl. Math. 6, 66–92 (1960)

    Article  MATH  Google Scholar 

  2. Cho, S., Huynh, D.T.: Finite-automaton aperiodicity is PSPACE-complete. Theoretical Computer Science 88, 99–116 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Diekert, V., Gastin, P.: First-order definable languages. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata: History and Perspectives. Texts in Logic and Games, pp. 261–306. Amsterdam University Press (2008)

    Google Scholar 

  4. Krishnan, S., Puri, A., Brayton, R.: Structural complexity of ω-automata. LNCS, vol. 915, pp. 143–156. Springer, Berlin (1995)

    Google Scholar 

  5. Meyer, A.: Weak monadic second order theory of successor is not elementary-recursive. Project MAC TR 38 (1973)

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  8. Selivanov, V.L.: Relating automata-theoretic hierarchies to complexity-theoretic hierarchies. Theoretical Informatics and Applications 36, 29–42 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Selivanov, V.L.: Fine hierarchy of regular aperiodic ω-languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 399–410. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

    Google Scholar 

  11. Stockmeyer, L.: The complexity of decision problems in automata theory and logic. Thesis, M.I.T. Project MAC TR-133 (1974)

    Google Scholar 

  12. Selivanov, V.L., Wagner, K.W.: Complexity of topological properties of regular ω-languages. Fundamenta Informatica 20, 1–21 (2008)

    MathSciNet  Google Scholar 

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

    Google Scholar 

  14. Thomas, W.: Languages, automata and logic. In: Handbook of Formal Languages, vol. 3, pp. 389–455 (1997)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. 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. LNCS, vol. 915, pp. 288–302. Springer, Berlin (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siberian Division 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

Arnold Beckmann Costas Dimitracopoulos Benedikt Löwe

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 Aperiodicity for Topological Properties of Regular ω-Languages. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69407-6_57

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69407-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation