Geodesic
Sur les transductions reconnaissables
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978) no. 3, pp. 203-212.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1978__12_3_203_0,
     author = {Choffrut, Christian},
     title = {Sur les transductions reconnaissables},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {203--212},
     publisher = {EDP-Sciences},
     volume = {12},
     number = {3},
     year = {1978},
     mrnumber = {510638},
     zbl = {0423.20053},
     language = {fr},
     url = {http://geodesic.mathdoc.fr/item/ITA_1978__12_3_203_0/}
}
TY  - JOUR
AU  - Choffrut, Christian
TI  - Sur les transductions reconnaissables
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1978
SP  - 203
EP  - 212
VL  - 12
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1978__12_3_203_0/
LA  - fr
ID  - ITA_1978__12_3_203_0
ER  - 
%0 Journal Article
%A Choffrut, Christian
%T Sur les transductions reconnaissables
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1978
%P 203-212
%V 12
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1978__12_3_203_0/
%G fr
%F ITA_1978__12_3_203_0
Choffrut, Christian. Sur les transductions reconnaissables. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978) no. 3, pp. 203-212. http://geodesic.mathdoc.fr/item/ITA_1978__12_3_203_0/

1. J. Berstel, Some Recent Results on Recognizable Formal Power Series in Fundamentals of Computation Theory, KARPINSKI, éd., Lecture Notes in Computer Science, n° 56, Springer, 1977, p. 39-48. | Zbl | MR

2. L. Boasson, B. Courcelle et M. Nivat, A New Complexity Measure for Languages in Conference on Theoretical Computer Sciences, Waterloo, Canada, 1977. | Zbl | MR

3. C. Choffrut, Thèse de Doctorat d'État, en préparation.

4. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974. | Zbl | MR

5. M. Fliess, Matrices de Hanlsel, J. Math. Pures appl., vol. 53, 1974, p, 197-222. | Zbl | MR

6. C. C. Elgot et G. Mezei, On Relations Defined by Generalized Finite Automata, I.B.M.J. Res. Develop., vol. 9, 1965, p. 47-65. | Zbl | MR

7. A. Mandel, K-subconjuntos limitados de um monoïde livre, Dissertaçao de Maestrado, Universidade de Sao Paulo, 1976.

8. M. Nivat, Transductions des langages de Chomsky, Ann. Inst. Fourier, Grenoble, vol. 18, 1968, p. 339-455. | Zbl | MR | mathdoc-id

9. C. Reutenauer, C. R. Acad. Sc. Paris, t. 284, série A, 1977, p. 1159. | Zbl | MR

10. E. Sontag, On Some Questions of Rationality and Decidability, J. Comput. System Sc., vol. 11, 1975, p. 375-381. | Zbl | MR