Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. J. Berstel and C. Reutenauer. Recognizable formal power series on trees. Theoretical Computer Science, 18:115–148, 1982.
2. J. Berstel and Ch. Reutenauer. Rational Series and Their Languages, volume 12 of EATCS-Monographs. Springer Verlag, 1988.
3. B. Borchardt and H. Vogler. Determinization of Finite State Weighted Tree Automata. J. Automata, Languages and Combinatorics, accepted, 2003.
4. S. Bozapalidis. Effective constuction of the syntactic algebra of a recognizable series on trees. Acta Informatica, 28:351–363, 1991.
5. J. Doner. Tree acceptors and some of their applications. J. Comput. System Sci., 4:406–451, 1970.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献