On the word problem for free completely regular semigroups (Q1085283): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:55, 31 January 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
