On the word problem for free completely regular semigroups (Q1085283)
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 3981439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the word problem for free completely regular semigroups |
scientific article; zbMATH DE number 3981439 |
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
0.9192150831222534
0 references
0.8798878192901611
0 references
0.8711387515068054
0 references
