Combinatorial problems by termination of rewriting

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Downloads (Pure)


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 languageEnglish
Title of host publicationProceedings 10th International Workshop on Termination (WST'09, Leipzig, Germany, June 3-5, 2009)
Publication statusPublished - 2010
Event10th International Workshop on Termination WST 2009 -
Duration: 3 Jun 20095 Jun 2009


Conference10th International Workshop on Termination WST 2009


Dive into the research topics of 'Combinatorial problems by termination of rewriting'. Together they form a unique fingerprint.

Cite this