Deux remarques sur un théorème de S. Eilenberg
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1983)
- Volume: 17, Issue: 1, page 23-48
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 1. A. ARNOLD et M. LATTEUX, A new proof of two theorems about rational transductions, Theoret. Computer Sci., vol. 8, 1979, p. 261-263. Zbl0401.68057MR526208
- 2. J. BERSTEL, Transductions and context-free languages, Teubner, 1979. Zbl0424.68040MR549481
- 3. S. EILENBERG, Automata, Languages, and Machines, vol. A, Academic Press, 1974. Zbl0317.94045MR530382
- 4. K. KOBAYASHI, Classification of formal languages by functionnal binary transductions, Inform. and Control, vol. 15, 1969, p. 95-109. Zbl0193.32501MR249226
- 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. Zbl0405.68067MR568112
- 6. J. SAKAROVITCH, Syntaxe des langages de Chomsky, Thèse. Sci. Math., Univ., Paris VII, Paris, 1979.