Author:
Durand Irène,Middeldorp Aart
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference30 articles.
1. Term Rewriting and All That;Baader,1998
2. Sequentiality, monadic second-order logic and tree automata;Comon;Inform. Comput.,2000
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree automata techniques and applications, draft (2002). Available from:
4. J. Coquidé, R. Gilleron, Proofs and reachability problem for ground rewrite systems, in: Proceedings of the 6th International Meeting of Young Computer Scientists, Lecture Notes in Computer Science, vol. 464, 1990, pp. 120–129
5. Decidability of the confluence of finite ground term rewriting systems and of other related term rewriting systems;Dauchet;Inform. Comput.,1990
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献