The Knuth-Bendix Completion Procedure and Thue Systems
From MaRDI portal
Recommendations
Cited in
(39)- On the regular equivalence problem for regular Thue systems
- Special monoids and special Thue systems
- Thue systems as rewriting systems
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Unification in Boolean rings
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
- Completing a finite special string-rewriting system on the congruence class of the empty word
- Contributions of Ronald V. Book to the theory of string-rewriting systems
- The finiteness of finitely presented monoids
- Homotopy reduction systems for monoid presentations
- Codes modulo finite monadic string-rewriting systems
- Constructing finitely presented monoids which have no finite complete presentation
- Undecidable properties of monoids with word problem solvable in linear time.
- Cancellativity in finitely presented semigroups
- Fast left Kan extensions using the chase
- Algebra and geometry of rewriting
- On term rewriting systems in unary signature
- scientific article; zbMATH DE number 4014065 (Why is no real title available?)
- scientific article; zbMATH DE number 4016226 (Why is no real title available?)
- scientific article; zbMATH DE number 3850464 (Why is no real title available?)
- scientific article; zbMATH DE number 4030960 (Why is no real title available?)
- scientific article; zbMATH DE number 4043234 (Why is no real title available?)
- Existence, Uniqueness, and Construction of Rewrite Systems
- scientific article; zbMATH DE number 671957 (Why is no real title available?)
- Algebraic data integration
- Abstract reduction systems and idea of Knuth-Bendix completion algorithm
- Gröbner bases of associative algebras and the Hochschild cohomology
- Restrictions of congruences generated by finite canonical string-rewriting systems
- It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
- Order Reconfiguration under Width Constraints
- Equational Theorem Proving for Clauses over Strings
- A finitely presented monoid which has solvable word problem but has no regular complete presentation
- On weakly confluent monadic string-rewriting systems
- Congruence closure modulo groups
- Equational theorem proving for clauses over strings
- An Isabelle/HOL formalization of semi-Thue and conditional semi-Thue systems
- A new lower bound construction for commutative Thue systems with applications
- About the descriptive power of certain classes of finite string-rewriting systems
- Complete rewriting systems and homology of monoid algebras
This page was built for publication: The Knuth-Bendix Completion Procedure and Thue Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696494)
