Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference12 articles.
1. Andre, Y., and Bossut, F., Decidability of equivalence for linear letter-to-letter top-down tree transducers, in:Proceedings of FCT '93 (Z. Ésik, ed.), Lecture Notes in Computer Science, Vol. 710, Springer-Verlag, Berlin, 1993, pp. 142–151.
2. Baker, B. S., Composition of top-down and bottom-up tree transductions,Inform, and Control,41 (1979), 186–213.
3. Burris, S., and Sankappanavar, H. P.,A Course in Universal Algebra, Springer-Verlag, New York, 1981.
4. Engelfriet, J., Bottom-up and top-down tree transformations—a comparison,Math. Systems Theory 9 (1975), 198–231.
5. Engelfriet, J., Three hierarchies of transducers,Math. Systems Theory 15 (1982), 95–125.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献