Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings 10th International Workshop on Termination (WST'09, Leipzig, Germany, June 3-5, 2009) |
| Pages | ...-... |
| Publication status | Published - 2010 |
| Event | 10th International Workshop on Termination WST 2009 - Duration: 3 Jun 2009 → 5 Jun 2009 |
Conference
| Conference | 10th International Workshop on Termination WST 2009 |
|---|---|
| Period | 3/06/09 → 5/06/09 |