Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)

DOI10.1016/j.ipl.2005.12.011zbMath1187.68527OpenAlexW1529656135MaRDI QIDQ844184

Johannes Waldmann, Dieter Hofbauer

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.011

zbMATH Keywords

terminationstring rewritingautomatic theorem proving

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

On Subquadratic Derivational Complexity of Semi-Thue Systems ⋮ Termination of Cycle Rewriting by Transformation and Matrix Interpretation ⋮ On a method for proving exact bounds on derivational complexity in Thue systems ⋮ SAT modulo linear arithmetic for solving polynomial constraints ⋮ Matrix interpretations for proving termination of term rewriting ⋮ Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian

Uses Software

• MiniSat

Cites Work

• Decision problems for semi-Thue systems with a few rules
• Termination of context-sensitive rewriting
• Theory and Applications of Satisfiability Testing
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)