Termination of string rewriting proved automatically

DOI10.1007/S10817-005-6545-0MaRDI QIDQ850497zbMATH OpenOpenAlexFDO

Authors Hans Zantema

Publication date 3 November 2006

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10817-005-6545-0

zbMATH Keywords

terminationrelative terminationstring rewritingmatch-boundssemantic labelling

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Implementation and Application of Automata
• FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
• Termination by Quasi-periodic Interpretations
• Termination of String Rewriting with Matrix Interpretations
• Weighted automata for proving termination of string rewriting

Cites work

• scientific article; zbMATH DE number 3729436 (Why is no real title available?)
• scientific article; zbMATH DE number 49211 (Why is no real title available?)
• scientific article; zbMATH DE number 50662 (Why is no real title available?)
• scientific article; zbMATH DE number 2043537 (Why is no real title available?)
• scientific article; zbMATH DE number 2043538 (Why is no real title available?)
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• Implementation and Application of Automata
• Match-bounded string rewriting systems
• Mathematical Foundations of Computer Science 2003
• Non-Looping String Rewriting
• On recursive path ordering
• Orderings for term-rewriting systems
• Rewriting Techniques and Applications
• Termination of rewriting systems by polynomial interpretations and its implementation
• Termination of string rewriting proved automatically
• Termination of term rewriting using dependency pairs
• Termination of term rewriting: Interpretation and type elimination
• The 3x + 1 Problem and Its Generalizations

Cited in

(26)

• Match-bounds revisited
• A non-termination criterion for binary constraint logic programs
• scientific article; zbMATH DE number 2040918 (Why is no real title available?)
• Termination by Quasi-periodic Interpretations
• Proving termination of context-sensitive rewriting with MU-TERM
• FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
• Proving Termination of Rewrite Systems Using Bounds
• Loops under Strategies
• Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
• TPA: Termination Proved Automatically
• scientific article; zbMATH DE number 7559287 (Why is no real title available?)
• Root-Labeling
• Deciding Innermost Loops
• Finding and certifying loops
• An automated approach to the Collatz conjecture
• An automated approach to the Collatz conjecture
• Implementation and Application of Automata
• scientific article; zbMATH DE number 2043544 (Why is no real title available?)
• Non-termination in Term Rewriting and Logic Programming
• Mechanizing and improving dependency pairs
• On tree automata that certify termination of left-linear term rewriting systems
• Lower bounds for runtime complexity of term rewriting
• Loop detection in term rewriting using the eliminating unfoldings
• Adding constants to string rewriting
• A complete mechanization of correctness of a string-preprocessing algorithm
• Termination of string rewriting proved automatically

Describes a project that uses

Uses Software

• REVE
• TORPA
• Tsukuba
• Matchbox
• CiME
• AProVE

This page was built for publication: Termination of string rewriting proved automatically

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