Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Comon, H., Godoy, G., Nieuwenhuis, R.: The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. In: 42nd Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, USA (2001)
2. Comon, H., Jacquemard, F., Dauchet, M., Lugiez, D., Gilleron, R., Tison, S., Tomassi, M.: Tree Automata Techniques and Applications, available on internet under,
http://www.grappa.univ-lille3.fr/tata/
3. Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Decision Problems in Ordered Rewriting. In: IEEE Symposium on Logic in Computer Science, Indianapolis, IN, USA (1998)
4. Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Deciding the Confluence of Ordered Term Rewrite Systems. ACM Transactions on Computational Logic, 33–55 (2003)
5. Dauchet, M., Tison, S.: The Theory of Ground Rewrite Systems is Decidable. In: IEEE Symposium on Logic in Computer Science, Philadelphia, PA (1990)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献