Skip to main content

A Fine Hierarchy of ω-Regular k-Partitions

  • Conference paper
Models of Computation in Context (CiE 2011)

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

Included in the following conference series:

Abstract

We develop the theory of ω-regular k-partitions (for arbitrary k ≥ 2) that extends the theory around the Wagner hierarchy of regular ω-languages. In particular, we characterize the structure of Wadge degrees of ω-regular k-partitions, prove the decidability of any level of the corresponding hierarchy, establish coincidence of the reducibilities by continuous functions and by functions computed by finite automata on the ω-regular k-partitions.

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

Access this chapter

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. Andretta, A.: More on Wadge determinacy. Annals of Pure and Applied Logic 144, 2–32 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hertling, P.: Topologische Komplexitätsgrade von Funktionen mit endlichem Bild. Informatik-Berichte 152, 34 pages, Fernuniversität Hagen (December 1993)

    Google Scholar 

  3. Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1994)

    MATH  Google Scholar 

  4. Kosub, S.: On NP-partitions over posets with an application to reducing the set of solutions of NP problems. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 467–476. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Kosub, S., Wagner, K.W.: The Boolean Hierarchy of NP-Partitions. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 157–168. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Selivanov, V.L.: Boolean hierarchy of partitions over reducible bases. Algebra and Logic 43(1), 77–109 (2004); (Russian, there is an English translation)

    Article  MathSciNet  MATH  Google Scholar 

  8. Selivanov, V.L.: The quotient algebra of labeled forests modulo h-equivalence. Algebra and Logic 46(2), 120–133 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

  10. Selivanov, V.L.: Fine hierarchies via Priestley duality (submitted)

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Selivanov, V. (2011). A Fine Hierarchy of ω-Regular k-Partitions. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21875-0_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21874-3

  • Online ISBN: 978-3-642-21875-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics