Non-Looping String Rewriting

DOI10.1051/ita:1999118zbMath0951.68054OpenAlexW2115636831MaRDI QIDQ4718895

Alfons Geser, Hans Zantema

Publication date: 4 January 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222096

zbMATH Keywords

loopsstring rewriting reductions

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Grammars and rewriting systems (68Q42)

Related Items (10)

Termination of string rewriting proved automatically ⋮ Loop detection in term rewriting using the eliminating unfoldings ⋮ Match-bounded string rewriting systems ⋮ Decision problems for semi-Thue systems with a few rules ⋮ Unnamed Item ⋮ Proof Relevant Corecursive Resolution ⋮ On normalizing, non-terminating one-rule string rewriting systems ⋮ On prefixal one-rule string rewrite systems ⋮ Relative undecidability in term rewriting. I: The termination hierarchy ⋮ Relative undecidability in term rewriting. II: The confluence hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problems of equality and divisibility in semigroups with a single defining relation
• Natural termination
• The undecidability of self-embedding for finite semi-Thue and Thue systems
• Termination of rewriting
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• One-rule semi-Thue systems with loops of length one, two or three
• Tree-Manipulating Systems and Church-Rosser Theorems
• Semi-Thue systems with an inhibitor
• Termination and derivational complexity of confluent one-rule string-rewriting systems

This page was built for publication: Non-Looping String Rewriting