Non-termination using Regular Languages
arXiv:1405.5662
Abstract
We describe a method for proving non-looping non-termination, that is, of term rewriting systems that do not admit looping reductions. As certificates of non-termination, we employ regular (tree) automata.
Published at International Workshop on Termination 2014