Deux remarques sur un théorème de S. Eilenberg
Sakarovitch, Jacques
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 17 (1983), p. 23-48 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1983__17_1_23_0,
     author = {Sakarovitch, Jacques},
     title = {Deux remarques sur un th\'eor\`eme de S. Eilenberg},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {17},
     year = {1983},
     pages = {23-48},
     mrnumber = {701986},
     zbl = {0512.68063},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1983__17_1_23_0}
}

Sakarovitch, Jacques. Deux remarques sur un théorème de S. Eilenberg. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 17 (1983) pp. 23-48. http://gdmltest.u-ga.fr/item/ITA_1983__17_1_23_0/

1. A. Arnold et M. Latteux, A new proof of two theorems about rational transductions, Theoret. Computer Sci., vol. 8, 1979, p. 261-263. | MR 526208 | Zbl 0401.68057

2. J. Berstel, Transductions and context-free languages, Teubner, 1979. | MR 549481 | Zbl 0424.68040

3. S. Eilenberg, Automata, Languages, and Machines, vol. A, Academic Press, 1974. | MR 530382 | Zbl 0317.94045

4. K. Kobayashi, Classification of formal languages by functionnal binary transductions, Inform. and Control, vol. 15, 1969, p. 95-109. | MR 249226 | Zbl 0193.32501

5. J. Sakarovitch, Théorème de transversale rationnelle pour les automates à pile déterministes, in Proc. of the 4th G. I. Conf. on Theoretical Computer Science. (K. Weikrauch, ed.), Lecture Notes in Computer Sci., vol. 67, Springer, 1979, p. 276-285. | MR 568112 | Zbl 0405.68067

6. J. Sakarovitch, Syntaxe des langages de Chomsky, Thèse. Sci. Math., Univ., Paris VII, Paris, 1979.