Iteration of rational transductions

Alain Terlutte; David Simplot

RAIRO - Theoretical Informatics and Applications (2010)

  • Volume: 34, Issue: 2, page 99-129
  • ISSN: 0988-3754

Abstract

top
The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of transductions containing length-preserving rational transductions and closed under union, composition and iteration. We give several characterizations of this class using restricted classes of length-preserving rational transductions, by showing the connections with "context-sensitive transductions" and transductions associated with recognizable picture languages.

How to cite

top

Terlutte, Alain, and Simplot, David. "Iteration of rational transductions." RAIRO - Theoretical Informatics and Applications 34.2 (2010): 99-129. <http://eudml.org/doc/222099>.

@article{Terlutte2010,
abstract = { The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of transductions containing length-preserving rational transductions and closed under union, composition and iteration. We give several characterizations of this class using restricted classes of length-preserving rational transductions, by showing the connections with "context-sensitive transductions" and transductions associated with recognizable picture languages. },
author = {Terlutte, Alain, Simplot, David},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {length-preserving rational transductions; linear space computations},
language = {eng},
month = {3},
number = {2},
pages = {99-129},
publisher = {EDP Sciences},
title = {Iteration of rational transductions},
url = {http://eudml.org/doc/222099},
volume = {34},
year = {2010},
}

TY - JOUR
AU - Terlutte, Alain
AU - Simplot, David
TI - Iteration of rational transductions
JO - RAIRO - Theoretical Informatics and Applications
DA - 2010/3//
PB - EDP Sciences
VL - 34
IS - 2
SP - 99
EP - 129
AB - The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of transductions containing length-preserving rational transductions and closed under union, composition and iteration. We give several characterizations of this class using restricted classes of length-preserving rational transductions, by showing the connections with "context-sensitive transductions" and transductions associated with recognizable picture languages.
LA - eng
KW - length-preserving rational transductions; linear space computations
UR - http://eudml.org/doc/222099
ER -

References

top
  1. A. Avizienis, Signed-digit number representations for fast parallel arithmetic. IRE Trans. Electronic Computers10 (1961) 389-400.  
  2. J. Berstel, Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart (1979).  
  3. M. Clerbout and M. Latteux, Partial commutations and faithful rational transductions. Theoret. Comput. Sci.34 (1984) 241-254.  
  4. S. Eilenberg, Automata, Languages and Machines, Vol. A. Academic Press, New York (1974).  
  5. C.C. Elgot and J.E. Mezei, On relations defined by generalized finite automata. IBM J. Res. Develop.9 (1965) 47-68.  
  6. D. Giammarresi and A. Restivo, Two-dimensional languages, in Handbook of Formal Languages, edited by A. Salomaa and G. Rozenberg, Vol. 3. Springer-Verlag, Berlin (1997) 215-267.  
  7. S.A. Greibach, Full AFL's and nested iterated substitution. Inform. and Control (Shenyang)16 (1970) 7-35.  
  8. T. Harju and J. Karhumäki, Morphisms, in Handbook of Formal Languages, edited by A. Salomaa and G. Rozenberg, Vol. 1. Springer-Verlag, Berlin (1997) 439-510.  
  9. N. Immerman, Nondeterministic space is closed under complementation. SIAM J. Comput.17 (1988) 935-938.  
  10. S.-Y. Kuroda, Classes of languages and linear bounded automata. Inform. and Control (Shenyang)7 (1964) 207-223.  
  11. M. Latteux and D. Simplot, Recognizable picture languages and domino tiling. Theoret. Comput. Sci.178 (1997) 275-283.  
  12. M. Latteux and D. Simplot, Context-sensitive string languages and recognizable picture languages. Inform. and Comput.138 (1997) 160-169.  
  13. 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.  
  14. M. Latteux and P. Turakainen, On characterizations of recursively enumerable languages. Acta Inform.28 (1990) 179-186.  
  15. J. Leguy, Transductions rationnelles décroissantes. RAIRO Theoret. Informatics Appl.15 (1981) 141-148.  
  16. É. Lilin, Une généralisation des semi-commutations. Tech. Rep. it-210, L.I.F.L., Université Lille 1, France (1991).  
  17. J.-M. Muller, Some characterizations of functions computable in on-line arithmetic. IEEE Trans. Comput.43 (1994) 752-755.  
  18. M. Nivat, Transductions des langages de Chomsky. Ann. Inst. Fourier (Grenoble)18 (1968) 339-456.  
  19. M.P. Schützenberger, Sur les relations rationnelles entre monoïdes libres. Theoret. Comput. Sci.3 (1976) 243-259.  
  20. D. Simplot and A. Terlutte, Closure under union and composition of iterated rational transductions (in preparation).  
  21. R. Szelepcsényi, The method of forced enumeration for nondeterministic automata. Acta Inform.26 (1988) 279-284.  
  22. M. Szijártó, A classification and closure properties of languages for describing concurrent system behaviours. Fund. Inform.4 (1981) 531-549.  
  23. P. Turakainen, Transducers and compositions of morphisms and inverse morphisms, in Studies in honour of Arto Kustaa Salomaa on the occasion of his fiftieth birthday. Ann. Univ. Turku. Ser. A I 186 (1984) 118-128.  
  24. D. Wood, Iterated a-NGSM maps and Γ systems. Inform. and Control (Shenyang)32 (1976) 1-26.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.