THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T<sup>m</sup>=T<sup>m+n</sup> WITH m≥4 OR m=3, n=1 (Q3141772)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 438819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T<sup>m</sup>=T<sup>m+n</sup> WITH m≥4 OR m=3, n=1 |
scientific article; zbMATH DE number 438819 |
Statements
THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T<sup>m</sup>=T<sup>m+n</sup> WITH m≥4 OR m=3, n=1 (English)
0 references
1 November 1993
0 references
word problem
0 references
relatively free Burnside semigroup
0 references
regular subset
0 references
free semigroup
0 references
0.9763362407684326
0 references
0.9759578704833984
0 references
0.9145445227622986
0 references
0.8501505851745605
0 references
0.8444404006004333
0 references
