Chain properties of rule closures
From MaRDI portal
Publication:5096168
DOI10.1007/BFb0028997zbMath1492.68069MaRDI QIDQ5096168
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
68Q42: Grammars and rewriting systems
Related Items
Cites Work
- Unnamed Item
- Termination of rewriting
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- On Proving Uniform Termination and Restricted Termination of Rewriting Systems
- It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
- Tree-Manipulating Systems and Church-Rosser Theorems