Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup (Q1701408): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2559985756 / rank | |||
Normal rank | |||
Revision as of 18:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
