Rational relations with bounded delay

  • Christiane Frougny
  • Jacques Sakarovitch
Automata And Formal Languages

DOI: 10.1007/BFb0020787

Part of the Lecture Notes in Computer Science book series (LNCS, volume 480)
Cite this paper as:
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


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Christiane Frougny
    • 1
  • Jacques Sakarovitch
    • 2
  1. 1.Litp and Université Paris VIIIFrance
  2. 2.Litp, Institut Blaise PascalParis Cedex 05France

Personalised recommendations