Skip to main content
SpringerLink
Log in

Classifying \(\omega \)-Regular Aperiodic k-Partitions

  • Conference paper
  • First Online:
Descriptional Complexity of Formal Systems (DCFS 2020)

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

Included in the following conference series:

Abstract

We develop a theory of \(\omega \)-regular aperiodic k-partitions (for arbitrary \(k\ge 2\)) that extends existing results for the \(\omega \)-regular k-partitions and for the fine hierarchy of regular aperiodic \(\omega \)-languages (which coincide with 2-partitions). In particular, we characterize the structure of Wadge degrees of \(\omega \)-regular aperiodic k-partitions, prove the decidability of many related problems, and discuss their complexity.

Supported by the Russian Science Foundation, project 18-11-00100.

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 EPUB and 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

References

  1. Carton, O., Perrin, D.: Chains and superchains for \(\omega \)-rational sets, automata and semigroups. Int. J. Algebra Comput. 7, 673–695 (1997)

    Article  MathSciNet  Google Scholar 

  2. Carton, O., Perrin, D.: The wagner hierarchy of \(\omega \)-rational sets. Int. J. Algebra Comput. 9, 673–695 (1999)

    Article  Google Scholar 

  3. Duparc, J.: A hierarchy of deterministic context-free \(\omega \)-languages. Theor. Comput. Sci. 290(3), 1253–1300 (2003)

    Article  MathSciNet  Google Scholar 

  4. Duparc, J., Riss, M.: The missing link for \(\omega \)-rational sets, automata, and semigroups. Int. J. Algebra Comput. 16, 161–185 (2006)

    Article  MathSciNet  Google Scholar 

  5. Finkel, O.: Borel ranks and Wadge degrees of context-free \(\omega \)-languages. Math. Struct. Comput. Sci. 16, 813–840 (2006)

    Article  MathSciNet  Google Scholar 

  6. Hertling P., Selivanov V.L.: Complexity issues for preorders on finite labeled forests. In: Brattka, V., Diener, H., Spreen, D. (eds.) Logic, Computation, Hierarchies, pp. 165–190. Ontos Publishing, de Gruiter, Boston-Berlin (2014)

    Google Scholar 

  7. Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1994). https://doi.org/10.1007/978/-1-4612-4190-4

    Book  MATH  Google Scholar 

  8. Kihara, T., Montalbán, A.: On the structure of the Wadge degrees of BQO-valued Borel functions. Trans. Am. Math. Soc. 371(11), 7885–7923 (2019)

    Article  MathSciNet  Google Scholar 

  9. Krishnan, S.C., Puri, A., Brayton, R.K.: Structural complexity of \(\omega \) -automata. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 143–156. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-59042-0_69

    Chapter  Google Scholar 

  10. Kihara T., Selivanov V.: Wadge-like degrees of Borel BQO-valued functions. Arxiv 1909.10835 (2019)

    Google Scholar 

  11. Perrin D., Pin J.-E.: Infinite Words. v. 141 of pure and applied mathematics (Elsevier, 2004)

    Google Scholar 

  12. Selivanov, V.L.: Fine hierarchy of regular \(\omega \)-languages. Theor. Comput. Sci. 191, 37–59 (1998)

    Article  MathSciNet  Google Scholar 

  13. Selivanov, V.L.: Wadge degrees of \(\omega \)-languages of deterministic turing machines. Theor. Inf. Appl. 37, 67–83 (2003)

    Article  MathSciNet  Google Scholar 

  14. Selivanov V.L.: Classifying omega-regular partitions. In: Preproceedings of LATA-2007, Universitat Rovira i Virgili Report Series, 35/07, pp. 529–540 (2007)

    Google Scholar 

  15. Selivanov, V.L.: Fine hierarchy of regular aperiodic \(\omega \)-languages. Int. J. Found. Comput. Sci. 19(3), 649–675 (2008)

    Article  MathSciNet  Google Scholar 

  16. Selivanov, V.: A fine hierarchy of \(\omega \)-regualr \(k\)-partitions. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 260–269. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21875-0_28

    Chapter  MATH  Google Scholar 

  17. Selivanov, V.L.: Fine hierarchies via priestley duality. Ann. Pure Appl. Logic 163, 1075–1107 (2012)

    Article  MathSciNet  Google Scholar 

  18. Selivanov, V.L.: Extending wadge theory to k-partitions. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 387–399. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-58741-7_36

    Chapter  Google Scholar 

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

    Google Scholar 

  20. Wagner, K.: On \(\omega \)-regular sets. Inf. Control 43, 123–177 (1979)

    Article  Google Scholar 

  21. Wilke, T., Yoo, H.: Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds.) CAAP 1995. LNCS, vol. 915, pp. 288–302. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-59293-8_202

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems and Saint Petersburg State University, St. Petersburg, Russia

    Victor Selivanov

Authors
  1. Victor Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor Selivanov .

Editor information

Editors and Affiliations

  1. Slovak Academy of Sciences, Košice, Slovakia

    Galina Jirásková

  2. University of Milan, Milan, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Selivanov, V. (2020). Classifying \(\omega \)-Regular Aperiodic k-Partitions. In: Jirásková, G., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2020. Lecture Notes in Computer Science(), vol 12442. Springer, Cham. https://doi.org/10.1007/978-3-030-62536-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-62536-8_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-62535-1

  • Online ISBN: 978-3-030-62536-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation