It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
From MaRDI portal
Publication:5096169
DOI10.1007/BFb0028998zbMath1494.68119MaRDI QIDQ5096169
Jonathan Stillman, Paliath Narendran
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
Undecidability and degrees of sets of sentences (03D35) Grammars and rewriting systems (68Q42) Turing machines and related notions (03D10)
Related Items
Cites Work