Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. Transductions de forêts reconnaissables monadiques. Forêts corégulières;Arnold;RAIRO Inform. Théory,1976
2. A. Arnold, M. Dauchet, Bi-transductions de forêts, Automata, Languages and Programming (Proc. Conf. 1976), University Press, Edinburgh, 1976, pp. 74–86.
3. Un théorème de duplication pour les forêts algébriques;Arnold;J. Comput. System Sci.,1976
4. Morphisms et bimorphisms d'arbres;Arnold;Theoret. Comput. Sci.,1980
5. Tree transducers and tree languages;Baker;Inform. Control,1978
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS;International Journal of Foundations of Computer Science;2010-06
2. Alphabetic Pushdown Tree Transducers;Developments in Language Theory;2003