Adding constants to string rewriting

DOI10.1007/S00200-008-0060-6MaRDI QIDQ945008zbMATH OpenOpenAlexFDO

Authors René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp

Publication date 10 September 2008

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-008-0060-6

zbMATH Keywords

confluenceterm rewritingterminationstring rewriting

Mathematics Subject Classification ID

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

Recommendations

• On termination of confluent one-rule string-rewriting systems
• The termination hierarchy for term rewriting
• Termination of cycle rewriting
• Termination and derivational complexity of confluent one-rule string-rewriting systems
• On normalizing, non-terminating one-rule string rewriting systems

Cites work

• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Term Rewriting and All That
• Termination of string rewriting proved automatically
• Termination of term rewriting using dependency pairs

Describes a project that uses

Uses Software

• AProVE

This page was built for publication: Adding constants to string rewriting

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