Proving non-termination by finite automata

DOI10.4230/LIPIcs.RTA.2015.160zbMath1366.68115arXiv1505.00478OpenAlexW1849635240MaRDI QIDQ5277877

Jörg Endrullis, Hans Zantema

Publication date: 12 July 2017

Full work available at URL: https://arxiv.org/abs/1505.00478

zbMATH Keywords

finite automataregular languagesterm rewritingnon-termination

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (6)

Termination of Cycle Rewriting by Transformation and Matrix Interpretation ⋮ Transducer degrees: atoms, infima and suprema ⋮ Patch Graph Rewriting ⋮ Specifying graph languages with type graphs ⋮ Unnamed Item ⋮ Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting

This page was built for publication: Proving non-termination by finite automata