Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. Term Rewriting and All That;Baader,1998
2. D. Benanav, D. Kapur, P. Narendran, Complexity of matching problems, in: Proc. 1st Internat. Conf. on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, Vol. 202, Springer, Berlin, 1985, pp. 417–429.
3. Precise bounds for Presburger arithmetic and the reals with addition;Berman,1977
4. B. Bogaert, S. Tison, Equality and disequality constraints on direct subterms in tree automata, in: Proc. 9th Symp. on Theoretical Computer Science (STACS), Lecture Notes in Computer Science, Vol. 577, Springer, Berlin, 1992, pp. 161–172.
5. Logic and p-recognizable sets of integers;Bruyere;Bull. Belgian Math. Soc.,1994
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献