Author： Burckel S.
Publisher： Academic Press
ISSN： 0747-7171
Source： Journal of Symbolic Computation, Vol.31, Iss.5, 2001-05, pp. : 557-564
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We investigate the three-strand positive braid monoid. We propose a syntactical linear time algorithm for the word problem, a nearly canonical rewriting system and the computation of the growth function.
Related content
Syntactical and semantical aspects of Faust
By Orlarey Y. Fober D. Letz S.
Soft Computing, Vol. 8, Iss. 9, 2004-09 ,pp. :
Access to resources
Recommend
A syntactical proof of the Marriage Lemma
By Coquand T.
Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. :
A syntactical proof of the operational equivalence of two -terms
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
Massively parallel fault tolerant computations on syntactical patterns
Future Generation Computer Systems, Vol. 18, Iss. 7, 2002-08 ,pp. :