Transductions rationnelles décroissantes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1981)
- Volume: 15, Issue: 2, page 141-148
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- [1] J. BERSTEL, Transductions and Context-Free Languages, Teubner Verlag, 1979. Zbl0424.68040MR549481
- [2] L. BOASSON et M. NIVAT, Sur diverses familles de langages fermées par transduction rationnelle, Acta Informatica, vol. 2, 1973, p. 180-188. Zbl0242.68037MR331873
- [3] S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, 1974. Zbl0317.94045MR530382
- [4] C. C. ELGOT et J. F. MEZEI, On Relations Defined by Generalized Finite Automata, I.B.M. J. of Res. and Rev., vol. 9, 1965 p. 47-68. Zbl0135.00704MR216903
- [5] M. NIVAT, Transductions des langages de Chomsky, Ann. Inst. Fourier, Grenoble, vol. 18, 1968, p. 47-68. Zbl0313.68065MR238633
- [6] M. P. SCHÜTZENBERGER, Sur une variante des fonctions séquentielles, Theor. Comp. Sc., vol. 4, 1977, p. 48-57. Zbl0366.68043MR471448
Citations in EuDML Documents
top- Alain Terlutte, David Simplot, Iteration of rational transductions
- Alain Terlutte, David Simplot, Iteration of rational transductions
- D. Simplot, A. Terlutte, Closure under union and composition of iterated rational transductions
- D. Simplot, A. Terlutte, Closure under union and composition of iterated rational transductions