Skip to main content
SpringerLink
Log in

Rational relations with bounded delay

  • Automata And Formal Languages
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

Abstract

This paper presents a generalization of Eilenberg and Schützenberger's Theorem on length-preserving relations to rational relations with the property that the difference of lengths of two related words is bounded, and to rational relations of infinite words that are realized by 2-tape automata such that the distance between the two heads during any computation keeps bounded.

This work has been supported by the PRC Mathématiques et Informatique and by the working group ASMICS of the ESPRIT-BRA Program.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, Transductions and context-free languages. Teubner, 1979.

    Google Scholar 

  2. L. Boasson, Cônes rationnels et familles agréables de langages — Application au langage à compteur. Thèse de 3e cycle, Université Paris 7, 1971.

    Google Scholar 

  3. J. Cannon, D. Epstein, D. Holt, M. Paterson and W. Thurston, Word processing and group theory, Preprint.

    Google Scholar 

  4. M. Dauchet and S. Tison, The theory of ground rewrite systems is decidable. 5th IEEE Symposium LICS, 242–248, 1990.

    Google Scholar 

  5. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, 1974.

    Google Scholar 

  6. Ch. Frougny, Systèmes de numération linéaires et automates finis. Thèse d'Etat, Université Paris 7, Technical Report LITP 89-69, 1989.

    Google Scholar 

  7. Ch. Frougny, Representations of numbers and finite automata. Technical report LITP 90-47, to appear.

    Google Scholar 

  8. M. Latteux and E. Timmerman, Rational ω-transductions. Proceedings of MFCS, L.N.C.S. 452, 263–277, 1990.

    Google Scholar 

  9. J. Leguy, Transductions rationnelles décroissantes. R.A.I.R.O. Informatique Théorique 15, 141–148, 1981.

    Google Scholar 

  10. J. Sakarovitch, Deux remarques sur un théorème de S. Eilenberg. R.A.I.R.O Informatique Théorique 17, 23–48, 1983.

    Google Scholar 

  11. W. Thomas, Automata and quantifier hierarchies. In “Formal properties of finite automata and applications”, L.N.C.S. 386, 104–119, 1988.

    Google Scholar 

  12. W. Thomas, Infinite trees and automata definable relations over ω-words. Proceedings of STACS, L.N.C.S. 452, 407–415, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Litp and Université Paris VIII, France

    Christiane Frougny

  2. Litp, Institut Blaise Pascal, 4 place Jussieu, 75252, Paris Cedex 05, France

    Jacques Sakarovitch

Authors
  1. Christiane Frougny
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frougny, C., Sakarovitch, J. (1991). Rational relations with bounded delay. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020787

Download citation

  • DOI: https://doi.org/10.1007/BFb0020787

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation