Author:
Endrullis Jörg,Geuvers Herman,Simonsen Jakob Grue,Zantema Hans
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference41 articles.
1. Persistency of confluence;Aoto;Journal of Universal Computer Science,1997
2. Termination of term rewriting using dependency pairs;Arts;Theoretical Computer Science,2000
3. Conditional rewrite rules: confluence and termination;Bergstra;Journal of Computer and Systems Sciences,1986
4. The word problem;Boone;Proceedings of the National Academy of Sciences,1958
5. M. Dauchet, Termination of rewriting is undecidable in the one-rule case, in: MFCS, number 324 in LNCS, Springer, 1988, pp. 262–270.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits;Electronic Proceedings in Theoretical Computer Science;2024-08-12
2. Declassification Policy for Program Complexity Analysis;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. A General Noninterference Policy for Polynomial Time;Proceedings of the ACM on Programming Languages;2023-01-09
4. DECREASING DIAGRAMS FOR CONFLUENCE AND COMMUTATION;LOG METH COMPUT SCI;2020
5. Transducer degrees: atoms, infima and suprema;Acta Informatica;2019-12-05