We give an overview of some combinatorial problems that can be transformed to termination problems on rewriting. Some of them then can be solved by applying state-of-the-art-tools for proving termination automatically, others can not, in this way creating new challenges for future versions of termination tools.
|Titel||Proceedings 10th International Workshop on Termination (WST'09, Leipzig, Germany, June 3-5, 2009)|
|Status||Gepubliceerd - 2010|
|Evenement||10th International Workshop on Termination WST 2009 - |
Duur: 3 jun. 2009 → 5 jun. 2009
|Congres||10th International Workshop on Termination WST 2009|
|Periode||3/06/09 → 5/06/09|