Non-termination using Regular Languages
classification
💻 cs.LO
keywords
non-terminationregularadmitautomatacertificatesdescribeemploylanguages
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.