Skip to main content
SpringerLink
Log in

On Infinitary Rational Relations and Borel Sets

  • Conference paper
  • First Online:
Discrete Mathematics and Theoretical Computer Science (DMTCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2731))

Abstract

We prove in this paper that there exists some infinitary rational relations which are Σ 03 -complete Borel sets and some others which are Π 03 -complete. These results give additional answers to questions of Simonnet [Sim92] and of Lescow and Thomas [Tho90,LT94].

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. Ya M. Barzdin and B.A. Trakhtenbrot, Finite Automata, Behaviour and Synthesis, Nauka, Moscow, 1970 (English translation, North Holland, Amsterdam, 1973).

    Google Scholar 

  2. M.-P. Béal, O. Carton, C. Prieur, and J. Sakarovitch, Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality, Theoretical Computer Science, vol. 292, no. 1, pp. 45–63, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  3. J. Berstel, Transductions and Context Free Languages, Teubner Verlag, 1979.

    Google Scholar 

  4. Büc62. J.R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Logic Methodology and Philosophy of Science, (Proc. 1960 Int. Congr.), Stanford University Press, 1962, 1–11.

    Google Scholar 

  5. T. Cachat, J. Duparc, and W. Thomas, Solving Pushdown Games with a Σ 3 Winning Condition, proceedings of CSL 2002, LNCS 2471, pp. 322–336

    Google Scholar 

  6. C. Choffrut, Une Caractérisation des Fonctions Séquentielles et des Fonctions Sous-Séquentielles en tant que Relations Rationnelles, Theoretical Computer Science, Volume 5, 1977, p.325–338.

    Article  MathSciNet  Google Scholar 

  7. C. Choffrut and S. Grigorieff, Uniformization of Rational Relations, Jewels are Forever 1999, J. Karhumäki, H. Maurer, G. Paun, and G. Rozenberg editors, Springer, p.59–71.

    Google Scholar 

  8. J. Engelfriet and H. J. Hoogeboom, X-automata on ω-Words, Theoretical Computer Science 110 (1993) 1, 1–51.

    Article  MATH  MathSciNet  Google Scholar 

  9. O. Finkel, Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Vol 262(1–2), July 2001, p. 669–697.

    Article  MATH  MathSciNet  Google Scholar 

  10. O. Finkel, On the Topological Complexity of Infinitary Rational Relations, RAIRO-Theoretical Informatics and Applications, to appear.

    Google Scholar 

  11. C. Frougny and J. Sakarovitch, Synchronized Rational Relations of Finite and Infinite Words, Theoretical Computer Science 108 (1993) 1, p.45–82.

    Article  MATH  MathSciNet  Google Scholar 

  12. F. Gire, Relations Rationnelles Infinitaires, Thèse de troisième cycle, Université Paris 7, Septembre 1981.

    Google Scholar 

  13. F. Gire, Une Extension aux Mots Infinis de la Notion de Transduction Rationnelle, 6th GI Conf., Lect. Notes in Comp. Sci., Volume 145, 1983, p. 123–139.

    Google Scholar 

  14. F. Gire and M. Nivat, Relations Rationnelles Infinitaires, Calcolo, Volume XXI, 1984, p. 91–125.

    Article  MathSciNet  Google Scholar 

  15. A.S. Kechris, Classical Descriptive Set Theory, Springer-Verlag, 1995.

    Google Scholar 

  16. L. H. Landweber, Decision Problems for ω-Automata, Math. Syst. Theory 3 (1969) 4, 376–384.

    Article  MATH  MathSciNet  Google Scholar 

  17. H. Lescow and W. Thomas, Logical Specifications of Infinite Computations, In: “A Decade of Concurrency” (J. W. de Bakker et al., eds), Springer LNCS 803 (1994), 583–621.

    Google Scholar 

  18. R. Lindner and L. Staiger, Algebraische Codierungstheorie-Theorie der Sequentiellen Codierungen, Akademie-Verlag, Berlin, 1977.

    MATH  Google Scholar 

  19. Y. N. Moschovakis, Descriptive Set Theory, North-Holland, Amsterdam 1980.

    MATH  Google Scholar 

  20. D. Perrin and J.-E. Pin, Infinite Words, Book in preparation, available from http://www.liafa.jussieu.fr/jep/InfiniteWords.html.

  21. J.-E. Pin, Logic, Semigroups and Automata on Words, Annals of Mathematics and Artificial Intelligence 16 (1996), p. 343–384.

    Article  MATH  MathSciNet  Google Scholar 

  22. C. Prieur, Fonctions Rationnelles de Mots Infinis et Continuité, Thèse de Doctorat, Université Paris 7, Octobre 2000.

    Google Scholar 

  23. P. Simonnet, Automates et Théorie Descriptive, Ph.D. Thesis, Université Paris 7, March 1992.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  25. L. Staiger, ω-Languages, Chapter of the Handbook of Formal languages, Vol 3, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, Berlin.

    Google Scholar 

  26. L. Staiger and K. Wagner, Rekursive Folgenmengen I, Z. Math Logik Grundlag. Math. 24, 1978, 523–538.

    Article  MATH  MathSciNet  Google Scholar 

  27. W. Thomas, Automata and Quantifier Hierarchies, in: Formal Properties of Finite automata and Applications, Ramatuelle, 1988, Lecture Notes in Computer Science 386, Springer, Berlin, 1989, p.104–119.

    Chapter  Google Scholar 

  28. W. Thomas, Automata on Infinite Objects, in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990), p. 133–191.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Equipe de Logique Mathématique, U.F.R. de Mathématiques, Université Paris 7, 2 Place Jussieu, 75251, Paris cedex 05, 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. Department of Computer Science, University of Auckland, Maths-Physics Building 303, 38 Princes St., Auckland, New Zealand

    Cristian S. Calude  & Michael J. Dinneen  & 

  2. Université de Bourgogne, LE2I, B.P. 47870, 21078, Dijon Cedex, France

    Vincent Vajnovszki

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Finkel, O. (2003). On Infinitary Rational Relations and Borel Sets. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds) Discrete Mathematics and Theoretical Computer Science. DMTCS 2003. Lecture Notes in Computer Science, vol 2731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45066-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45066-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40505-4

  • Online ISBN: 978-3-540-45066-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation