A result on braids via the investigation of a rewriting system.

DOI10.1016/S0747-7171(02)00130-XzbMath1044.20021MaRDI QIDQ1426138

Serge Burckel

Publication date: 14 March 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

normal formsword problempositive braid monoidsmonoid presentationslinear-time algorithmsfinite rewriting systemsbraid words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Braid groups; Artin groups (20F36) Grammars and rewriting systems (68Q42)

Related Items (1)

The Group BS(1,2) and a Construction of Magnus

Cites Work

• Unnamed Item
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• The wellordering on positive braids
• Braids and self-distributivity
• Theory of braids
• Braids, Links, and Mapping Class Groups. (AM-82)
• THE BRAID GROUP AND OTHER GROUPS
• Syntactical methods for braids of three strands

This page was built for publication: A result on braids via the investigation of a rewriting system.