Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference20 articles.
1. Encompassment properties and automata with constraints;Caron,1993
2. More problems in rewriting;Dershowitz,1993
3. Dershowitz, N., Jouannaud, J. P., and Klop, J. W.1995, Problems in rewriting III, inRewriting Techniques and Applications'95, Lecture Notes in Computer Science, Vol. 914, pp. 457–471, Springer-Verlag, Berlin/New York.
4. Automata for reduction properties solving;Dauchet;J. Symbolic Comput.,1995
5. The theory of ground rewrite systems is decidable;Dauchet,1990
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献