Termination of \aa bc,bb ac,cc ab\

DOI10.1016/J.IPL.2005.12.011MaRDI QIDQ844184zbMATH OpenOpenAlexFDO

Authors Dieter Hofbauer, Johannes Waldmann

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

automatic theorem provingstring rewritingtermination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites work

• Decision problems for semi-Thue systems with a few rules
• scientific article; zbMATH DE number 1638661 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• Termination of context-sensitive rewriting
• Theory and Applications of Satisfiability Testing

Cited in

(6)

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

Describes a project that uses

Uses Software

• MiniSat

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844184)