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.
References
J. BERSTEL, Transductions and context-free languages. Teubner Verlag, Stuttgart, 1979.
S. EILENBERG, Automata, languages and machines. Vol. A, Acacemic Press, 1974.
C.C. ELGOT and G. MEZEI, On relations defined by generalized finite automata. IBM J. Res. and Dev., Vol. 9, pp. 47–68, 1965.
M. LATTEUX and J. LEGUY, On the composition of morphisms and inverse morphisms. Lecture Notes in Comput. Sci., 154, pp. 420–432, 1983.
J. LEGUY, Transductions rationnelles décroissantes. RAIRO Info. Theor., Vol. 5, no 2, pp. 141–148, 1981.
M. NIVAT, Transductions des langages de Chomsky. Ann. Institut Fourier, Vol. 18, pp. 339–455, 1968.
M.P. SCHUTZENBERGER, Sur les relations rationnelles entre monoïdes libres. Theor. Comp. Sc., Vol. 3, pp. 243–259, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Terlutte, A. (1988). Cyclic rational transductions and polynomials of rational functions. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035841
Download citation
DOI: https://doi.org/10.1007/BFb0035841
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive