The Word Problem for the Burnside Varieties
โ Scribed by O. Kharlampovich
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 310 KB
- Volume
- 173
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
THE DECISION PROBLEM FOR CERTAIN NILPOTENT CLOSED VARIETIES by STEPHEN D. COMER in Charleston, South Carolina (U.S.A.
It is shown that a set of finite semigroups satisfying certain restrictions on spectra of sums of generators is finite.
We examine the idea of a free partially commutative, partially associative groupoid, and show that there is a linear-time algorithm for the word problem. Our work is an attempt to see how word problem results by Book, Liu, and Wrathall for monoids and groups might be extended to groupoids. Key word
One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topologi