Syntactical methods for braids of three strands (Q5938545): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 00:43, 5 March 2024

scientific article; zbMATH DE number 1622579
Language Label Description Also known as
English
Syntactical methods for braids of three strands
scientific article; zbMATH DE number 1622579

    Statements

    Syntactical methods for braids of three strands (English)
    0 references
    0 references
    22 July 2001
    0 references
    The author investigates the three-strand positive braid monoid. He proposes a syntactical linear time algorithm for the word problem, a nearly canonical rewriting system and the computation of the growth function.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    positive braid monoids
    0 references
    word problem
    0 references
    rewriting systems
    0 references
    growth functions
    0 references
    syntactical linear time algorithms
    0 references