@article{ITA_1978__12_3_203_0, author = {Choffrut, Christian}, title = {Sur les transductions reconnaissables}, journal = {RAIRO. Informatique th\'eorique}, pages = {203--212}, publisher = {EDP-Sciences}, volume = {12}, number = {3}, year = {1978}, mrnumber = {510638}, zbl = {0423.20053}, language = {fr}, url = {http://www.numdam.org/item/ITA_1978__12_3_203_0/} }
Choffrut, Christian. Sur les transductions reconnaissables. RAIRO. Informatique théorique, Tome 12 (1978) no. 3, pp. 203-212. http://www.numdam.org/item/ITA_1978__12_3_203_0/
1. 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. | MR | Zbl
,2. A New Complexity Measure for Languages in Conference on Theoretical Computer Sciences, Waterloo, Canada, 1977. | MR | Zbl
, et ,3. Thèse de Doctorat d'État, en préparation.
,4. Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974. | MR | Zbl
,5. Matrices de Hanlsel, J. Math. Pures appl., vol. 53, 1974, p, 197-222. | MR | Zbl
,6. On Relations Defined by Generalized Finite Automata, I.B.M.J. Res. Develop., vol. 9, 1965, p. 47-65. | MR | Zbl
et ,7. K-subconjuntos limitados de um monoïde livre, Dissertaçao de Maestrado, Universidade de Sao Paulo, 1976.
,8. Transductions des langages de Chomsky, Ann. Inst. Fourier, Grenoble, vol. 18, 1968, p. 339-455. | Numdam | MR | Zbl
, , C. R. Acad. Sc. Paris, t. 284, série A, 1977, p. 1159. |10. On Some Questions of Rationality and Decidability, J. Comput. System Sc., vol. 11, 1975, p. 375-381. | MR | Zbl
,