Author:
Kiefer Stefan,Marusic Ines,Worrell James
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science 18(2), 115–148 (1982)
2. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer (1997)
3. Borchardt, B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybern. 16(4), 509–544 (2004)
4. Bozapalidis, S.: Effective construction of the syntactic algebra of a recognizable series on trees. Acta Inf. 28(4), 351–363 (1991)
5. Bozapalidis, S., Alexandrakis, A.: Représentations matricielles des séries d’arbre reconnaissables. RAIRO-Theoretical Informatics and Applications-Informatique Théorique et Applications 23(4), 449–459 (1989)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Identity Testing for Radical Expressions;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
2. Approximate minimization of weighted tree automata;Information and Computation;2022-01
3. Learning Weighted Automata;Algebraic Informatics;2015