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): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 10:53, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
