On the word problem for free completely regular semigroups (Q1085283): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Jiří Kad'ourek / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Marie Demlová / rank | |||
| Property / author | |||
| Property / author: Jiří Kad'ourek / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Marie Demlová / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5344208 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The free completely regular semigroup on a set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Free completely regular semigroups. I: Representation. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Free completely regular semigroups. II: Word problem. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the varieties of completely regular semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Free completely regular semigroups / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:50, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the word problem for free completely regular semigroups |
scientific article |
Statements
On the word problem for free completely regular semigroups (English)
0 references
1986
0 references
A semigroup is completely regular if it is the union of its subgroups. The paper gives a simple solution of the word problem for free completely regular semigroups providing an algorithm convenient for applications.
0 references
word problem
0 references
free completely regular semigroups
0 references
