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. |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10474-017-0687-5 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2559985756 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1503.06818 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On disjoint unions of finitely many copies of the free monogenic semigroup. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A classification of disjoint unions of two or three copies of the free monogenic semigroup. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On generators and relations for unions of semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finitely approximable regular semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5650897 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4846425 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10474-017-0687-5 / rank | |||
Normal rank | |||
Latest revision as of 04:43, 11 December 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
0 references
