Closure under union and composition of iterated rational transductions
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 3, pp. 183-212. 
@article{ITA_2000__34_3_183_0,
     author = {Simplot, D. and Terlutte, A.},
     title = {Closure under union and composition of iterated rational transductions},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {183--212},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {3},
     year = {2000},
     mrnumber = {1796268},
     zbl = {0970.68085},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_2000__34_3_183_0/}
}
TY  - JOUR
AU  - Simplot, D.
AU  - Terlutte, A.
TI  - Closure under union and composition of iterated rational transductions
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2000
SP  - 183
EP  - 212
VL  - 34
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_2000__34_3_183_0/
LA  - en
ID  - ITA_2000__34_3_183_0
ER  - 
%0 Journal Article
%A Simplot, D.
%A Terlutte, A.
%T Closure under union and composition of iterated rational transductions
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2000
%P 183-212
%V 34
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_2000__34_3_183_0/
%G en
%F ITA_2000__34_3_183_0
Simplot, D.; Terlutte, A. Closure under union and composition of iterated rational transductions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 3, pp. 183-212. http://archive.numdam.org/item/ITA_2000__34_3_183_0/

[1] A. Arnold and M. Latteux, A new proof of two theorems about rational transductions. Theoret. Comput. Sci. 8 (1979) 261-263. | MR | Zbl

[2] J. Berstel, Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart (1979). | MR | Zbl

[3] S. Eilenberg, Automata, Languages and Machines, Vol. A. Academic Press, New York (1974). | MR | Zbl

[4] C. C. Elgot and J. E. Mezei, On relations defined by generalized finite automata. IBM J. Res. Develop. 9 (1965) 47-68. | MR | Zbl

[5] M. Latteux, D. Simplot and A. Terlutte, Iterated length-preserving rational transductions, in Proc. 23rd Symposium on Mathematical Foundations of Computer Science (MFCS'98) (Brno, Czech Republic, 1998), edited by L. Brim, J. Gruska and J. Zlatu_ka. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 1450 (1998) 286-295. | MR

[6] J. Leguy, Transductions rationnelles décroissantes. Theoret. Informatics Appl. 15 (1981) 141-148. | EuDML | Numdam | MR | Zbl

[7] M. Nivat, Transductions des langages de Chomsky. Ann. Inst. Fourier (Grenoble) 18 (1968) 339-456. | EuDML | Numdam | MR | Zbl

[8] M. P. Schützenberger, Sur les relations rationnelles entre monoïdes libres. Theoret. Comput. Sci. 3 (1976243-259. | MR | Zbl

[9] D. Simplot and A. Terlutte, Iterations of Transductions. Theoret. Informatics Appl. 34 (2000) 99-130. | EuDML | Numdam | MR | Zbl

[10] D. Wood, Iterated a-NGSM maps and Γ Systems. Inform. and Control 32 (1976) 1-26. | MR | Zbl