Transducteurs finis d'arbres et tests d'égalité
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1981)
- Volume: 15, Issue: 3, page 213-232
- ISSN: 0988-3754
Access Full Article
top
How to cite
topLilin, E.. "Transducteurs finis d'arbres et tests d'égalité." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 15.3 (1981): 213-232. <http://eudml.org/doc/92142>.
@article{Lilin1981,
author = {Lilin, E.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {equality of trees; tree transducers; linear transducers; bimorphisms; composition closure},
language = {fre},
number = {3},
pages = {213-232},
publisher = {EDP-Sciences},
title = {Transducteurs finis d'arbres et tests d'égalité},
url = {http://eudml.org/doc/92142},
volume = {15},
year = {1981},
}
TY - JOUR
AU - Lilin, E.
TI - Transducteurs finis d'arbres et tests d'égalité
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1981
PB - EDP-Sciences
VL - 15
IS - 3
SP - 213
EP - 232
LA - fre
KW - equality of trees; tree transducers; linear transducers; bimorphisms; composition closure
UR - http://eudml.org/doc/92142
ER -
References
top- 1. A. V. AHO et J. D. ULLMAN, Syntax Directed Translations and the Pushdow Assembler, J. Comput. System Sc., vol. 3, 1969, p. 37-56. Zbl0182.02003MR241199
- 2. A. ARNOLD, Systèmes d'équations dans le magmoïde, ensembles rationnels et algébriques d'arbres, Thèse d'État, Université de Lille (1977).
- 3. A. ARNOLD et M. DAUCHET, Transductions de forêts reconnaissables monadiques. Forêts corégulières R.A.I.R.O., vol. 10, 1976, p. 5-23. Zbl0363.68104MR416121
- 4. A. ARNOLD et M. DAUCHET, Théorie des magmoïdes, R.A.I.R.O., vol. 12, p. 235-257 et R.A.I.R.O., vol. 13, p. 135-154. Zbl0391.68037
- 5. B. BAKER, Tree Transduction and Family of Tree Languages, 5th AC.M. proc. on Theory of Computing, 1973, p. 200-206. Zbl0319.68040MR464711
- 6. W. S. BRAINERD, Tree Generating Regular Systems, Inf. and Control, vol. 14, 1969, p. 217-231. Zbl0169.31601MR239875
- 7. M. DAUCHET, Transductions de forêts. Bimorphismes de magmoïdes, Thèse d'État, Université de Lille, 1977. Zbl0363.68104
- 8. J. DONER, Tree Acceptors and Some of Their Applications, J. Comput. System Sc., vol. 4, 1970, p. 406-451. Zbl0212.02901MR287977
- 9. J. ENGELFRIET, Bottom up and Top-Down Tree Transformation, a Comparison, Math. System Theory, vol. 9, 1975, p. 198-231. Zbl0335.68061MR398700
- 10. J. ENGELFRIET, Top-Down Tree Transducers with Reqular Look-Ahead, Math. System Theory, vol. 10, 1977, p. 289-303. Zbl0369.68048MR489019
- 11. J. ENGELFRIET, A Hierarchy of Tree Transducers, Communication au 3e colloque de Lille sur « Les Arbres en Algèbre et Programmation », 1978. Zbl0386.68070MR505844
- 12. E. LILIN, Une généralisation des transducteurs d'états finis d'arbres : les S-trans-transducteurs, Thèse de 3e cycle, Université de Lille, 1978.
- 13. M. NIVAT, Transduction des langages de Chomsky, Ann. Inst. Fourrier, Grenoble, vol. 10, 1968, p. 339-455. Zbl0313.68065MR238633
- 14. C. PAIR et A. QUERE, Definition et étude des bilangages réguliers, Inf. and Control, vol. 13, 1968, p. 565-593. Zbl0181.01603MR250803
- 15. W. C. ROUNDS, Tree Transducers and TransformationPh. D. Dissertation Stanford University, 1968.
- 16. W. C. ROUNDS, Mapping and Grammars on Trees, Math. System Theory, vol. 4, 1970, p. 257-287. Zbl0203.30103MR269440
- 17. J. W. THATCHER, Characterizing Derivation Trees of Context-Free Grammars Through a Generalization of Finite Automate Theory, J. Comput. System Sc, vol. 1, 1967, p. 317-322. Zbl0155.01802MR233703
- 18. J. W. THATCHER, Generalized Sequential Machine Maps, J. Comput. System Sc., vol. 4, 1970, p. 339-367. Zbl0198.03303MR302335
NotesEmbed ?
topYou 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.