Closure under union and composition of iterated rational transductions
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2000)
- Volume: 34, Issue: 3, page 183-212
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- [1] A. Arnold and M. Latteux, A new proof of two theorems about rational transductions. Theoret. Comput. Sci. 8 (1979) 261-263. Zbl0401.68057MR526208
- [2] J. Berstel, Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart (1979). Zbl0424.68040MR549481
- [3] S. Eilenberg, Automata, Languages and Machines, Vol. A. Academic Press, New York (1974). Zbl0317.94045MR530382
- [4] C. C. Elgot and J. E. Mezei, On relations defined by generalized finite automata. IBM J. Res. Develop. 9 (1965) 47-68. Zbl0135.00704MR216903
- [5] M. Latteux, D. Simplot and A. Terlutte, Iterated length-preserving rational transductions, in Proc. 23rd Symposium on Mathematical Foundations of Computer Science (MFCS'98) (Brno, Czech Republic, 1998), edited by L. Brim, J. Gruska and J. Zlatu_ka. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 1450 (1998) 286-295. MR1684072
- [6] J. Leguy, Transductions rationnelles décroissantes. Theoret. Informatics Appl. 15 (1981) 141-148. Zbl0456.68097MR618451
- [7] M. Nivat, Transductions des langages de Chomsky. Ann. Inst. Fourier (Grenoble) 18 (1968) 339-456. Zbl0313.68065MR238633
- [8] M. P. Schützenberger, Sur les relations rationnelles entre monoïdes libres. Theoret. Comput. Sci. 3 (1976243-259. Zbl0358.68129MR445927
- [9] D. Simplot and A. Terlutte, Iterations of Transductions. Theoret. Informatics Appl. 34 (2000) 99-130. Zbl0962.68090MR1774304
- [10] D. Wood, Iterated a-NGSM maps and Γ Systems. Inform. and Control 32 (1976) 1-26. Zbl0346.68036MR416130