Non-termination using Regular Languages
Logic in Computer Science
2014-05-23 v1
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.
Keywords
Cite
@article{arxiv.1405.5662,
title = {Non-termination using Regular Languages},
author = {Jörg Endrullis and Hans Zantema},
journal= {arXiv preprint arXiv:1405.5662},
year = {2014}
}
Comments
Published at International Workshop on Termination 2014