Presentations and word problem for strong semilattices of semigroups
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Presentations and word problem for strong semilattices of semigroups
|
|
| Creator |
Ayık, G.
Ayık, H. Unlu, Y. |
|
| Description |
Let I be a semilattice, and Si (i ∈ I) be a family of disjoint semigroups. Then we prove that the strong semilattice S = S[I, Si , φj,i] of semigroups Si with homomorphisms φj,i : Sj → Si (j ≥ i) is finitely presented if and only if I is finite and each Si (i ∈ I) is finitely presented. Moreover, for a finite semilattice I, S has a soluble word problem if and only if each Si (i ∈ I) has a soluble word problem. Finally, we give an example of nonautomatic semigroup which has a soluble word problem. |
|
| Date |
2019-06-20T02:30:48Z
2019-06-20T02:30:48Z 2005 |
|
| Type |
Article
|
|
| Identifier |
Presentations and word problem for strong semilattices of semigroups / G. Ayık, H. Ayık, Y. Unlu // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 4. — С. 28–35. — Бібліогр.: 11 назв. — англ.
1726-3255 2000 Mathematics Subject Classification: 20M05. http://dspace.nbuv.gov.ua/handle/123456789/157334 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|