Word problem in free clumps
type: Item
instance of: scholarly article
title: Word problem in free clumps
zbMATH Open document ID: 0752.08006
DOI: 10.1016/0304-3975(92)90034-D
author: Patrick Dehornoy
published in: Theoretical Computer Science
publication date: 1992-09-26T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 08A99
Mathematics Subject Classification ID: 08A50
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 55530
zbMATH Keywords: free clumps
zbMATH Keywords: distributive law
zbMATH Keywords: algorithm
zbMATH Keywords: word problem
zbMATH Keywords: free left distributive structures
zbMATH Keywords: braid group
MaRDI profile type: Publication
cites work: Thue systems as rewriting systems
cites work: Q5515373
cites work: Free distributive groupoids
cites work: Q4206948
cites work: Structural Monoids Associated to Equational Varieties
cites work: Q4694272
description: scientific article; zbMATH DE number 55530