Advertisement

Cyclic rational transductions and polynomials of rational functions

  • Alain Terlutte
Contributed Papers Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)

Abstract

This paper is a contribution to the study of some rational transductions of finite image. We analyze the relationship between polynomially bounded rational transductions, cyclic rational transductions of finite image and polynomials of rational functions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. BERSTEL, Transductions and context-free languages. Teubner Verlag, Stuttgart, 1979.Google Scholar
  2. [2]
    S. EILENBERG, Automata, languages and machines. Vol. A, Acacemic Press, 1974.Google Scholar
  3. [3]
    C.C. ELGOT and G. MEZEI, On relations defined by generalized finite automata. IBM J. Res. and Dev., Vol. 9, pp. 47–68, 1965.Google Scholar
  4. [4]
    M. LATTEUX and J. LEGUY, On the composition of morphisms and inverse morphisms. Lecture Notes in Comput. Sci., 154, pp. 420–432, 1983.Google Scholar
  5. [5]
    J. LEGUY, Transductions rationnelles décroissantes. RAIRO Info. Theor., Vol. 5, no 2, pp. 141–148, 1981.Google Scholar
  6. [6]
    M. NIVAT, Transductions des langages de Chomsky. Ann. Institut Fourier, Vol. 18, pp. 339–455, 1968.Google Scholar
  7. [7]
    M.P. SCHUTZENBERGER, Sur les relations rationnelles entre monoïdes libres. Theor. Comp. Sc., Vol. 3, pp. 243–259, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Alain Terlutte
    • 1
  1. 1.Université des Sciences et Techniques de Lille Flandres-Artois U.F.R. d'I.E.E.A. Bât. M3 - InformatiqueVilleneuve D'Ascq Cedex

Personalised recommendations