Combinatorial problems by termination of rewriting
Hans Zantema · TU/e Research Portal · 2010
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.