Sur les transductions reconnaissables. (French) Zbl 0423.20053


20M05 Free semigroups, generators and relations, word problems
20M15 Mappings of semigroups
20M35 Semigroups in automata theory, linguistics, etc.
68Q45 Formal languages and automata
Full Text: EuDML


[1] 1. J. BERSTEL, Some Recent Results on Recognizable Formal Power Series in Fundamentals of Computation Theory, KARPINSKI, éd., Lecture Notes in Computer Science, n^\circ 56, Springer, 1977, p. 39-48. Zbl0365.68061 MR483737 · Zbl 0365.68061
[2] 2. L. BOASSON, B. COURCELLE et M. NIVAT, A New Complexity Measure for Languages in Conference on Theoretical Computer Sciences, Waterloo, Canada, 1977. Zbl0431.68077 MR495182 · Zbl 0431.68077
[3] 3. C. CHOFFRUT, Thèse de Doctorat d’État, en préparation.
[4] 4. S. EILENBERG, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974. Zbl0317.94045 MR530382 · Zbl 0317.94045
[5] 5. M. FLIESS, Matrices de Hanlsel, J. Math. Pures appl., vol. 53, 1974, p, 197-222. Zbl0315.94051 MR364328 · Zbl 0315.94051
[6] 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. Zbl0135.00704 MR216903 · Zbl 0135.00704
[7] 7. A. MANDEL, K-subconjuntos limitados de um monoïde livre, Dissertaçao de Maestrado, Universidade de Sao Paulo, 1976.
[8] 8. M. NIVAT, Transductions des langages de Chomsky, Ann. Inst. Fourier, Grenoble, vol. 18, 1968, p. 339-455. Zbl0313.68065 MR238633 · Zbl 0313.68065
[9] 9. C. REUTENAUER, C. R. Acad. Sc. Paris, t. 284, série A, 1977, p. 1159. Zbl0357.94024 MR432794 · Zbl 0357.94024
[10] 10. E. SONTAG, On Some Questions of Rationality and Decidability, J. Comput. System Sc., vol. 11, 1975, p. 375-381. Zbl0357.68064 MR416878 · Zbl 0357.68064
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.