Non-termination using Regular Languages
Authors: Joerg Endrullis and Hans Zantema
Paper Information
| Title: | Non-termination using Regular Languages |
| Authors: | Joerg Endrullis and Hans Zantema |
| Proceedings: | WST 2014 Informal Proceedings |
| Editor: | Carsten Fuhs |
| Keywords: | term rewriting, non-termination, tree automata, regular languages |
| Abstract: | ABSTRACT. We describe a method for proving non-termination of term rewriting systems that do not admit looping reductions, that is, reductions of the form $t \to^* C[t\sigma]$. As certificates of non-termination, we employ regular automata. |
| Pages: | 5 |
| Talk: | Jul 17 09:45 |
| Paper: |  |