Author:
Coquand Thierry,Persson Henrik
Publisher
Springer Berlin Heidelberg
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS;International Journal of Foundations of Computer Science;2005-06
2. Termination Proofs for String Rewriting Systems via Inverse Match-Bounds;Journal of Automated Reasoning;2005-05
3. Match-Bounded String Rewriting Systems;Applicable Algebra in Engineering, Communication and Computing;2004-10-14
4. Match-Bounded String Rewriting Systems;Mathematical Foundations of Computer Science 2003;2003