Author:
Geser Alfons,Middeldorp Aart,Ohlebusch Enno,Zantema Hans
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference20 articles.
1. Persistency of confluence;Aoto;Journal of Universal Computer Science,1997
2. Baader, F, and, Nipkow, T. 1998, Term Rewriting and All That, Cambridge Univ. Press, Cambridge, UK.
3. Dershowitz, N., and Jouannaud, J.-P.1990, Rewrite systems, inHandbook of Theoretical Computer ScienceJ. van Leeuwen, Ed., Vol. 277, pp. 243–320, Elsevier, Amsterdam.
4. Relative Undecidability in Term Rewriting. I. The Termination Hierarchy;Geser;Inform. and Comput.,2002
5. Geser, A., Middeldorp, A., Ohlebusch, E., and Zantema, H.1997, Relative undecidability in term rewriting, inProceedings of the 10th Annual Conference of the European Association for Computer Science Logic, Lecture Notes in Computer Science, Vol. 1258, pp. 150–166, Springer-Verlag, Berlin.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献