๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Dehn's algorithm for the word problem
โœ Martin Greendlinger ๐Ÿ“‚ Article ๐Ÿ“… 1960 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 778 KB
The Decision Problem for Certain Nilpote
โœ Stephen D. Comer ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 280 KB

THE DECISION PROBLEM FOR CERTAIN NILPOTENT CLOSED VARIETIES by STEPHEN D. COMER in Charleston, South Carolina (U.S.A.

A Theorem in Semigroups Inspired by the
โœ S.P. Strunkov; K.P. Shum ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 80 KB

It is shown that a set of finite semigroups satisfying certain restrictions on spectra of sums of generators is finite.

The Word Problem for Free Partially Comm
โœ David P. Jacobs; Sekhar V. Muddana ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 161 KB

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

A New Algorithm for Solving the Word Pro
โœ D. Garber; S. Kaplan; M. Teicher ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 148 KB

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