Word problem in free clumps
From MaRDI portal
We describe a tractable yet unproved algorithm for solving the word problem in free left distributive structures. The correctness and termination of this algorithm is connected with the existence of some normal forms in an extension of a braid group.
Recommendations
Cites work
- Free distributive groupoids
- scientific article; zbMATH DE number 4127515 (Why is no real title available?)
- scientific article; zbMATH DE number 218582 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- Structural Monoids Associated to Equational Varieties
- Thue systems as rewriting systems
Cited in
(6)
This page was built for publication: Word problem in free clumps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190471)