Closure under union and composition of iterated rational transductions
RAIRO - Theoretical Informatics and Applications (2010)
- Volume: 34, Issue: 3, page 183-212
- ISSN: 0988-3754
Access Full Article
topAbstract
topHow to cite
topReferences
top- A. Arnold and M. Latteux, A new proof of two theorems about rational transductions. Theoret. Comput. Sci.8 (1979) 261-263.
- J. Berstel, Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart (1979).
- S. Eilenberg, Automata, Languages and Machines, Vol. A. Academic Press, New York (1974).
- C.C. Elgot and J.E. Mezei, On relations defined by generalized finite automata. IBM J. Res. Develop.9 (1965) 47-68.
- 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. Zlatuska. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci.1450 (1998) 286-295.
- J. Leguy, Transductions rationnelles décroissantes. Theoret. Informatics Appl.15 (1981) 141-148.
- M. Nivat, Transductions des langages de Chomsky. Ann. Inst. Fourier (Grenoble)18 (1968) 339-456.
- M.P. Schützenberger, Sur les relations rationnelles entre monoïdes libres. Theoret. Comput. Sci.3 (1976) 243-259.
- D. Simplot and A. Terlutte, Iterations of Transductions. Theoret. Informatics Appl.34 (2000) 99-130.
- D. Wood, Iterated a-NGSM maps and systems. Inform. and Control32 (1976) 1-26.