Author:
Droste Manfred,Fülöp Zoltán,Kószó Dávid,Vogler Heiko
Publisher
Springer International Publishing
Reference39 articles.
1. Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleene’s theorem. Inf. Process. Lett. 24(1), 1–4 (1987)
2. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18(2), 115–148 (1982)
3. Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)
4. Borchardt, B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybern. 16(4), 509–544 (2004)
5. Borchardt, B., Fülöp, Z., Gazdag, Z., Maletti, A.: Bounds for tree automata with polynomial costs. J. Autom. Lang. Comb. 10, 107–157 (2005)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献