THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T<sup>a</sup> = T<sup>a+b</sup> WITH a ≥ 6 (Q3358946): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s021819679100002x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041507263 / rank | |||
Normal rank | |||
Latest revision as of 08:30, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T<sup>a</sup> = T<sup>a+b</sup> WITH a ≥ 6 |
scientific article |
Statements
THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T<sup>a</sup> = T<sup>a+b</sup> WITH a ≥ 6 (English)
0 references
1991
0 references
Green relation
0 references
finite automaton
0 references
alphabet
0 references
decidable word problem
0 references
presentation
0 references
Burnside semigroups
0 references
maximal subgroups
0 references
