Skip to main content

There Exist Some ω-Powers of Any Borel Rank

  • Conference paper
Book cover Computer Science Logic (CSL 2007)

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

Included in the following conference series:

Abstract

The operation VV ω is a fundamental operation over finitary languages leading to ω-languages. Since the set Σ ω of infinite words over a finite alphabet Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers of finitary languages naturally arises and has been posed by Niwinski [Niw90], Simonnet [Sim92] and Staiger [Sta97a] . It has been recently proved that for each integer n ≥ 1, there exist some ω-powers of context free languages which are \({\bf \Pi}_n^0\)-complete Borel sets,[Fin01], that there exists a context free language L such that L ω is analytic but not Borel,[Fin03] , and that there exists a finitary language V such that V ω is a Borel set of infinite rank, [Fin04]. But it was still unknown which could be the possible infinite Borel ranks of ω-powers.

We fill this gap here, proving the following very surprising result which shows that ω-powers exhibit a great topological complexity: for each non-null countable ordinal ξ, there exist some -complete ω-powers, and some -complete ω-powers.

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

References

  • Arnold, A.: Topological Characterizations of Infinite Behaviours of Transition Systems, Automata, Languages and Programming, J. In: Díaz, J. (ed.) Automata, Languages and Programming. LNCS, vol. 154, pp. 28–38. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  • Autebert, J.-M., Berstel, J., Boasson, L.: Context Free Languages and Pushdown Automata. In: Handbook of Formal Languages, vol. 1, Springer, Heidelberg (1996)

    Google Scholar 

  • Duparc, J.: Wadge Hierarchy and Veblen Hierarchy: Part 1: Borel Sets of Finite Rank. Journal of Symbolic Logic 66(1), 56–86 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Duparc, J., Finkel, O.: An ω-Power of a Context-Free Language Which Is Borel Above Δ 0 ω . In: submitted to the Proceedings of the International Conference Foundations of the Formal Sciences V: Infinite Games, Bonn, Germany (November 26-29, 2004)

    Google Scholar 

  • Finkel, O.: Topological Properties of Omega Context Free Languages. Theoretical Computer Science 262(1-2), 669–697 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Finkel, O.: Borel Hierarchy and Omega Context Free Languages. Theoretical Computer Science 290(3), 1385–1405 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Finkel, O.: An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. Fundamenta Informaticae 62(3-4), 333–342 (2004)

    MATH  MathSciNet  Google Scholar 

  • Finkel, O.: Borel Ranks and Wadge Degrees of Omega Context Free Languages. Mathematical Structures in Computer Science 16(5), 813–840 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley Publishing Company, Reading, Massachussetts (1969)

    MATH  Google Scholar 

  • Kechris, A.S.: Classical Descriptive Set Theory. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  • Kechris, A.S., Marker, D., Sami, R.L.: Π 1 1 Borel Sets. The Journal of Symbolic Logic 54(3), 915–920 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  • Kuratowski, K.: Topology, vol. 1. Academic Press, New York (1966)

    Google Scholar 

  • Lecomte, D.: Sur les Ensembles de Phrases Infinies Constructibles a Partir d’un Dictionnaire sur un Alphabet Fini, Séminaire d’Initiation a l’Analyse, vol. 1, année (2001-2002)

    Google Scholar 

  • Lecomte, D.: Omega-Powers and Descriptive Set Theory. Journal of Symbolic Logic 70(4), 1210–1232 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Lescow, H., Thomas, W.: Logical Specifications of Infinite Computations. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) A Decade of Concurrency. LNCS, vol. 803, pp. 583–621. Springer, Heidelberg (1994)

    Google Scholar 

  • Moschovakis, Y.N.: Descriptive Set Theory. North-Holland, Amsterdam (1980)

    MATH  Google Scholar 

  • Niwinski, D.: Problem on ω-Powers posed in the Proceedings of the 1990 Workshop Logics and Recognizable Sets (Univ. Kiel)

    Google Scholar 

  • Perrin, D., Pin, J.-E.: Infinite Words, Automata, Semigroups, Logic and Games. Pure and Applied Mathematics 141 (2004)

    Google Scholar 

  • Simonnet, P.: Automates et Théorie Descriptive, Ph. D. Thesis, Université Paris 7 (March 1992)

    Google Scholar 

  • Staiger, L.: Hierarchies of Recursive ω-Languages. Jour. Inform. Process. Cybernetics EIK 22 5/6, 219–241 (1986)

    MathSciNet  Google Scholar 

  • Staiger, L.: ω-Languages, Chapter of the Handbook of Formal Languages. In: Rozenberg, G., Salomaa, A. (eds.), vol. 3, Springer, Heidelberg (1997)

    Google Scholar 

  • Staiger, L.: On ω-Power Languages, in New Trends in Formal Languages, Control, Coperation, and Combinatorics. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 377–393. Springer, Heidelberg (1997)

    Google Scholar 

  • Thomas, W.: Automata on Infinite Objects. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133–191. Elsevier, Amsterdam (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Duparc Thomas A. Henzinger

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Finkel, O., Lecomte, D. (2007). There Exist Some ω-Powers of Any Borel Rank. In: Duparc, J., Henzinger, T.A. (eds) Computer Science Logic. CSL 2007. Lecture Notes in Computer Science, vol 4646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74915-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74915-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74914-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics