Publication:3779786
From MaRDI portal
zbMath0638.68108MaRDI QIDQ3779786
Publication date: 1987
Related Items
Automating the Knuth Bendix ordering, About the descriptive power of certain classes of finite string-rewriting systems, A geometrical approach to multiset orderings, Generating polynomial orderings, Proving termination of (conditional) rewrite systems. A semantic approach, Orienting rewrite rules with the Knuth-Bendix order., An upper bound on the derivational complexity of Knuth-Bendix orderings., Rational languages defined with a non-associative concatenation