Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup (Q1701408)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup |
scientific article |
Statements
Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup (English)
0 references
22 February 2018
0 references
semigroup
0 references
decidability
0 references
word problem
0 references
membership problem
0 references
0 references
0.88194954
0 references
0.8769922
0 references
0.87337005
0 references
0.87161577
0 references
0.8683246
0 references
0.86803544
0 references
0.8672257
0 references
