Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleenes theorem. Information Processing Letters 24(1), 1–4 (1987)
2. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science 18(2), 115–148 (1982)
3. Engelfriet, J., Fülöop, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Automata, Languages and Combinatorics 7, 11–70 (2002)
4. Ferdinand, C., Seidl, H., Wilhelm, R.: Tree automata for code selection. Acta Informatica 31(8), 741–760 (1994)
5. Glanville, R.S., Graham, S.L.: A new method for compiler code generation. In: Proceedings of the 5th ACM Symposium on Principles of Programming Languages, pp. 231–240 (1978)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献