Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Proceedings of the 9th Symposium on Theoretical Computer Science, volume 577 of Lecture Notes in Computer Science, pages 161–172, 1992.
2. F. Gécseg and M. Steinby. Tree automata. Akadémiai Kiadó, Budapest, Hungary, 1984.
3. E. Kounalis, D. Lugiez, and L. Pottier. A solution of the complement problem in associative commutative theories. In A.Tarlecki, editor, 16th International Symposium Mathematical Foundation of Computer Sciences, volume 520 of Lecture Notes in Computer Science, pages 287–297. Springer-Verlag, 1991.
4. D. Kapur, P. Narendran, D.J. Rosenkrantz, and H. Zhang. Sufficientcompleteness, quasi-reducibility and their complexity. Technical report, State University of New York at Albany, 1987.
5. D. Lugiez and J.L. Moysset. Complement problems and tree automata in ac-like theories. Technical Report 92-R-175, CRIN, 1992.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献