Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. Composition of top-down and bottom-up tree transductions;Baker;Inform. Control,1979
2. Recognizable formal power series on trees;Berstel;Theoret. Comput. Sci.,1982
3. B. Borchardt, The MYHILL–NERODE theorem for recognizable tree series, in: Seventh Internat. Conf. on Developments in Language Theory, DLT 2003, Szeged, Hungary, July 7–11, 2003, Proceedings, Lecture Notes in Computer Science, Vol. 2710, Springer, Berlin, 2003, pp. 146–158.
4. B. Borchardt, Code selection by tree series transducers, in: M. Domaratzki, A. Okhotin, K. Salomaa, S. Yu (Eds.), Implementation and Application of Automata, Ninth Internat. Conf. CIAA 2004, Kingston, Canada, July 22–24, 2004, Revised Selected Papers, Lecture Notes in Computer Science, Vol. 3317, Springer, Berlin, 2004, pp. 57–67.
5. Determinization of finite state weighted tree automata;Borchardt;J. Automata Languages Combin.,2003
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献