scientific article
From MaRDI portal
Publication:3795205
zbMath0649.68026MaRDI QIDQ3795205
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Undecidability and degrees of sets of sentences (03D35) Abstract data types; algebraic specification (68Q65)
Related Items
Simulation of Turing machines by a left-linear rewrite rule ⋮ Extensions and comparison of simplification orderings ⋮ On confluence of one-rule trace-rewriting systems ⋮ AC-Termination of rewrite systems: A modified Knuth-Bendix ordering ⋮ One-rule trace-rewriting systems and confluence ⋮ Levels of undecidability in rewriting ⋮ Simulation of Turing machines by a regular rewrite rule ⋮ One-rule semi-Thue systems with loops of length one, two or three