The Knuth-Bendix Completion Procedure and Thue Systems
From MaRDI portal
Publication:3696494
DOI10.1137/0214073zbMath0576.68010OpenAlexW2093250851MaRDI QIDQ3696494
Deepak Kapur, Paliath Narendran
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214073
Related Items
On the regular equivalence problem for regular Thue systems, Special monoids and special Thue systems, Codes modulo finite monadic string-rewriting systems, Restrictions of congruences generated by finite canonical string-rewriting systems, Thue systems as rewriting systems, Constructing finitely presented monoids which have no finite complete presentation, Computing a Gröbner basis of a polynomial ideal over a Euclidean domain, Unification in Boolean rings, Gröbner bases of associative algebras and the Hochschild cohomology, Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems, Algebraic data integration, Order Reconfiguration under Width Constraints, Equational Theorem Proving for Clauses over Strings, Undecidable properties of monoids with word problem solvable in linear time., About the descriptive power of certain classes of finite string-rewriting systems, Complete rewriting systems and homology of monoid algebras, Algebra and geometry of rewriting, A finitely presented monoid which has solvable word problem but has no regular complete presentation, Completing a finite special string-rewriting system on the congruence class of the empty word, On weakly confluent monadic string-rewriting systems, Contributions of Ronald V. Book to the theory of string-rewriting systems, The finiteness of finitely presented monoids, Cancellativity in finitely presented semigroups, Homotopy reduction systems for monoid presentations, Fast left Kan extensions using the chase
