Papers
Topics
Authors
Recent
Search
2000 character limit reached

Non-termination using Regular Languages

Published 22 May 2014 in cs.LO | (1405.5662v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Jörg Endrullis 
  2. Hans Zantema 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up