Skip to main content
SpringerLink
Log in

Topological Complexity of Context-Free ω-Languages: A Survey

  • Chapter
Book cover Language, Culture, Computation. Computing - Theory and Technology

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8001))

Abstract

We survey recent results on the topological complexity of context-free ω-languages which form the second level of the Chomsky hierarchy of languages of infinite words. In particular, we consider the Borel hierarchy and the Wadge hierarchy of non-deterministic or deterministic context-free ω-languages. We study also decision problems, the links with the notions of ambiguity and of degrees of ambiguity, and the special case of ω-powers.

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. Andretta, A., Camerlo, R.: The use of complexity hierarchies in descriptive set theory and automata theory. Task Quarterly 9(3), 337–356 (2005)

    Google Scholar 

  2. Arnold, A.: Topological characterizations of infinite behaviours of transition systems. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 28–38. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  3. Autebert, J.-M., Berstel, J., Boasson, L.: Context free languages and pushdown automata. In: Handbook of Formal Languages, vol. 1. Springer (1996)

    Google Scholar 

  4. Beauquier, D.: Some results about finite and infinite behaviours of a pushdown automaton. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 187–195. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  5. Berstel, J.: Transductions and context free languages. Teubner Studienbücher Informatik (1979)

    Google Scholar 

  6. Berstel, J., Perrin, D.: Theory of codes. Academic Press (1985)

    Google Scholar 

  7. Boasson, L.: Context-free sets of infinite words. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol. 67, pp. 1–9. Springer, Heidelberg (1979)

    Google Scholar 

  8. Boasson, L., Nivat, M.: Adherences of languages. Journal of Computer and System Science 20(3), 285–309 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cachat, T.: Symbolic strategy synthesis for games on pushdown graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 704–715. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Cachat, T., Duparc, J., Thomas, W.: Solving pushdown games with a Σ3 winning condition. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 322–336. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Cachat, T., Walukiewicz, I.: The complexity of games on higher order pushdown automata (May 2007), http://fr.arxiv.org/abs/0705.0262

  12. Cagnard, B., Simonnet, P.: Baire and automata. Discrete Mathematics and Theoretical Computer Science 9(2), 255–296 (2007)

    MathSciNet  MATH  Google Scholar 

  13. 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  MathSciNet  MATH  Google Scholar 

  14. Carton, O., Perrin, D.: The Wagner hierarchy of ω-rational sets. International Journal of Algebra and Computation 9(5), 597–620 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Chomshy, N.: Three models for the description of language. IRE Transactions on Information Theory 2(3), 113–124 (1956)

    Article  Google Scholar 

  16. Choueka, Y.: Theories of automata on omega-tapes: A simplified approach. Journal of Computer and System Science 8(2), 117–141 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  17. Choueka, Y.: Finite automata, definable sets, and regular expressions over ωn-tapes. Journal of Computer and System Science 17(1), 81–97 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  18. Choueka, Y., Peleg, D.: A note of omega-regular languages. Bulletin of the EATCS 21, 21–23 (1983)

    Google Scholar 

  19. Cohen, R.S., Gold, A.Y.: Theory of ω-languages, parts one and two. Journal of Computer and System Science 15, 169–208 (1977)

    Article  MathSciNet  Google Scholar 

  20. Cohen, R.S., Gold, A.Y.: ω-computations on deterministic pushdown machines. Journal of Computer and System Science 16, 275–300 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  21. Cohen, R.S., Gold, A.Y.: ω-computations on Turing machines. Theoretical Computer Science 6, 1–23 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  22. Duparc, J.: La forme Normale des Boréliens de rang finis. PhD thesis, Université Paris VII (1995)

    Google Scholar 

  23. Duparc, J.: Wadge hierarchy and Veblen hierarchy: Part 1: Borel sets of finite rank. Journal of Symbolic Logic 66(1), 56–86 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  24. Duparc, J.: A hierarchy of deterministic context free ω-languages. Theoretical Computer Science 290(3), 1253–1300 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  25. Duparc, J., Finkel, O.: An ω-power of a context free language which is Borel above \({\Delta}_\omega^0\). In: Proceedings of the International Conference Foundations of the Formal Sciences V: Infinite Games, Bonn, Germany, November 26-29. Studies in Logic, vol. 11, pp. 109–122. College Publications at King’s College (2007)

    Google Scholar 

  26. Duparc, J., Finkel, O., Ressayre, J.-P.: Computer science and the fine structure of Borel sets. Theoretical Computer Science 257(1-2), 85–105 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  27. Duparc, J., Riss, M.: The missing link for ω-rational sets, automata, and semigroups. International Journal of Algebra and Computation 16(1), 161–186 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  28. Engelfriet, J.: Iterated pushdown automata and complexity classes. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, USA, April 25-27, pp. 365–373. ACM Press (1983)

    Google Scholar 

  29. Engelfriet, J., Hoogeboom, H.J.: X-automata on ω-words. Theoretical Computer Science 110(1), 1–51 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  30. Finkel, O.: An effective extension of the wagner hierarchy to blind counter automata. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 369–383. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  31. Finkel, O.: On the Wadge hierarchy of omega context free languages. In: Proceedings of the International Workshop on Logic and Complexity in Computer Science, held in Honor of Anatol Slissenko for his 60th Birthday, Créteil, France, pp. 69–79 (2001)

    Google Scholar 

  32. Finkel, O.: Topological properties of omega context free languages. Theoretical Computer Science 262(1-2), 669–697 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  33. Finkel, O.: Wadge hierarchy of omega context free languages. Theoretical Computer Science 269(1-2), 283–315 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  34. Finkel, O.: Ambiguity in omega context free languages. Theoretical Computer Science 301(1-3), 217–270 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  35. Finkel, O.: Borel hierarchy and omega context free languages. Theoretical Computer Science 290(3), 1385–1405 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  36. Finkel, O.: On omega context free languages which are Borel sets of infinite rank. Theoretical Computer Science 299(1-3), 327–346 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  38. Finkel, O.: Borel ranks and Wadge degrees of context free ω-languages. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 129–138. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  39. Finkel, O.: On the length of the Wadge hierarchy of ω-context free languages. Journal of Automata, Languages and Combinatorics 10(4), 439–464 (2005)

    MathSciNet  MATH  Google Scholar 

  40. Finkel, O.: On winning conditions of high Borel complexity in pushdown games. Fundamenta Informaticae 66(3), 277–298 (2005)

    MathSciNet  MATH  Google Scholar 

  41. Finkel, O.: Borel ranks and Wadge degrees of omega context free languages. Mathematical Structures in Computer Science 16(5), 813–840 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  42. Finkel, O.: On the accepting power of 2-tape büchi automata. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 301–312. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  43. Finkel, O.: Wadge degrees of infinitary rational relations. Special Issue on Intensional Programming and Semantics in honour of Bill Wadge on the occasion of his 60th cycle, Mathematics in Computer Science 2(1), 85–102 (2008)

    MathSciNet  MATH  Google Scholar 

  44. Finkel, O., Lecomte, D.: There exist some ω-powers of any borel rank. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 115–129. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  45. Finkel, O., Simonnet, P.: Topology and ambiguity in omega context free languages. Bulletin of the Belgian Mathematical Society 10(5), 707–722 (2003)

    MathSciNet  MATH  Google Scholar 

  46. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  47. Greibach, S.A.: Remarks on blind and partially blind one way multicounter machines. Theoretical Computer Science 7, 311–324 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  48. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Co., Reading (2001)

    MATH  Google Scholar 

  49. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Co., Reading (1979)

    MATH  Google Scholar 

  50. Kechris, A.S.: Classical descriptive set theory. Springer, New York (1995)

    Book  MATH  Google Scholar 

  51. Kechris, A.S., Marker, D., Sami, R.L.: \({\Pi}_1^1\) Borel sets. Journal of Symbolic Logic 54(3), 915–920 (1989)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  53. Lecomte, D.: Sur les ensembles de phrases infinies constructibles a partir d’un dictionnaire sur un alphabet fini. In: Séminaire d’Initiation a l’Analyse, Université Paris 6, vol. 1 ( 2001-2002)

    Google Scholar 

  54. Lecomte, D.: Omega-powers and descriptive set theory. Journal of Symbolic Logic 70(4), 1210–1232 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  55. Lescow, H., Thomas, W.: Logical specifications of infinite computations. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 583–621. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  56. Linna, M.: On ω-words and ω-computations. Ann. Univ. Turku. Ser A I 168, 53 (1975)

    MathSciNet  MATH  Google Scholar 

  57. Linna, M.: On omega-sets associated with context-free languages. Information and Control 31(3), 272–293 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  58. Linna, M.: A decidability result for deterministic ω-context-free languages. Theoretical Computer Science 4, 83–98 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  59. Mihoubi, D.: Characterization and closure properties of linear omega-languages. Theoretical Computer Science 191(1-2), 79–95 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  60. Moschovakis, Y.N.: Descriptive set theory. North-Holland Publishing Co., Amsterdam (1980)

    MATH  Google Scholar 

  61. Muller, D.E.: Infinite sequences and finite machines. In: Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design, Chicago, Illinois, USA, October 28-30, pp. 3–16. IEEE (1963)

    Google Scholar 

  62. Mac Naughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9, 521–530 (1966)

    Article  MathSciNet  Google Scholar 

  63. Nivat, M.: Mots infinis engendrés par une grammaire algébrique. RAIRO Informatique Théorique et Applications 11, 311–327 (1977)

    MATH  Google Scholar 

  64. Nivat, M.: Sur les ensembles de mots infinis engendrés par une grammaire algébrique. RAIRO Informatique Théorique et Applications 12(3), 259–278 (1978)

    MATH  Google Scholar 

  65. Niwinski, D.: Fixed-point characterization of context-free ∞-languages. Information and Control 61(3), 247–276 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  66. Niwinski, D.: A problem on ω-powers. In: 1990 Workshop on Logics and Recognizable Sets, University of Kiel (1990)

    Google Scholar 

  67. Perrin, D., Pin, J.-E.: Infinite words, automata, semigroups, logic and games. Pure and Applied Mathematics, vol. 141. Elsevier (2004)

    Google Scholar 

  68. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)

    MathSciNet  MATH  Google Scholar 

  69. Selivanov, V.L.: Fine hierarchy of regular ω-languages. In: Mosses, P.D., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 277–287. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  71. Selivanov, V.L.: Wadge degrees of ω-languages of deterministic Turing machines. RAIRO-Theoretical Informatics and Applications 37(1), 67–83 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  72. Selivanov, V.L.: Wadge degrees of ω-languages of deterministic Turing machines. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 97–108. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  73. Serre, O.: Contribution à l’étude des jeux sur des graphes de processus à pile. PhD thesis, Université Paris VII (2004)

    Google Scholar 

  74. Serre, O.: Games with winning conditions of high borel complexity. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1150–1162. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  75. Simonnet, P.: Automates et théorie descriptive. PhD thesis, Université Paris VII (1992)

    Google Scholar 

  76. Staiger, L.: Hierarchies of recursive ω-languages. Elektronische Informationsverarbeitung und Kybernetik 22(5-6), 219–241 (1986)

    MathSciNet  MATH  Google Scholar 

  77. Staiger, L.: Research in the theory of ω-languages. Journal of Information Processing and Cybernetics 23(8-9), 415–439 (1987), Mathematical aspects of informatics (Mägdesprung, 1986)

    Google Scholar 

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

    Chapter  Google Scholar 

  79. Staiger, L.: On ω-power languages. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 377–393. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  80. Staiger, L., Wagner, K.: Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. Elektron. Informationsverarbeit. Kybernetik 10, 379–392 (1974)

    MathSciNet  MATH  Google Scholar 

  81. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal models and semantics, vol. B, pp. 135–191. Elsevier (1990)

    Google Scholar 

  82. Thomas, W.: Infinite games and verification (extended abstract of a tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 58–64. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  83. Wadge, W.: Reducibility and determinateness in the Baire space. PhD thesis, University of California, Berkeley (1983)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  85. Walukiewicz, I.: Pushdown processes: games and model checking. Information and Computation 157, 234–263 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  86. 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. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 288–302. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Equipe de Logique Mathématique, Institut de Mathématiques de Jussieu - Paris Rive Gauche UMR7586, CNRS et Université Paris Diderot Paris 7, Bâtiment Sophie Germain Case 7012, 75205, Paris Cedex 13, France

    Olivier Finkel

Authors
  1. Olivier Finkel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel

    Nachum Dershowitz

  2. Department of Computing, University of London, Goldsmiths College, 25–27 St. James, New Cross, SE14 6NW, London, UK

    Ephraim Nissan

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Finkel, O. (2014). Topological Complexity of Context-Free ω-Languages: A Survey. In: Dershowitz, N., Nissan, E. (eds) Language, Culture, Computation. Computing - Theory and Technology. Lecture Notes in Computer Science, vol 8001. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45321-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45321-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45320-5

  • Online ISBN: 978-3-642-45321-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation