Author:
Mitsuhashi Ichiro,Oyamaguch Michio,Jacquemard Florent
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
2. Comon, H., Godoy, G., Nieuwenhuis, R.: The confluence of ground term rewrite systems is decidable in polynomial time. In: Proc. 42nd Symp. Foundations of Computer Science (FOCS 2001), Las Vegas, NV, USA (October 2001)
3. Comon, H., Haberstrau, M., Jouannaud, J.-P.: Syntacticness, cycle-syntacticness and shallow theories. Information and Computation 111(1), 154–191 (1994)
4. Dauchet, M., Heuillard, T., Lescanne, P., Tison, S.: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation 88, 187–201 (1990)
5. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science, vol. B, pp. 243–320. Elsevier Science Publishers B. V., Amsterdam (1990)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献