Word problem in free clumps
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.
scientific article; zbMATH DE number 55530