Presentations and word problem for strong semilattices of semigroups
dc.contributor.author | Ayık, G. | |
dc.contributor.author | Ayık, H. | |
dc.contributor.author | Unlu, Y. | |
dc.date.accessioned | 2019-06-20T02:30:48Z | |
dc.date.available | 2019-06-20T02:30:48Z | |
dc.date.issued | 2005 | |
dc.description.abstract | 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. | uk_UA |
dc.identifier.citation | 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 назв. — англ. | uk_UA |
dc.identifier.issn | 1726-3255 | |
dc.identifier.other | 2000 Mathematics Subject Classification: 20M05. | |
dc.identifier.uri | https://nasplib.isofts.kiev.ua/handle/123456789/157334 | |
dc.language.iso | en | uk_UA |
dc.publisher | Інститут прикладної математики і механіки НАН України | uk_UA |
dc.relation.ispartof | Algebra and Discrete Mathematics | |
dc.status | published earlier | uk_UA |
dc.title | Presentations and word problem for strong semilattices of semigroups | uk_UA |
dc.type | Article | uk_UA |
Файли
Оригінальний контейнер
1 - 1 з 1
Контейнер ліцензії
1 - 1 з 1
Завантаження...
- Назва:
- license.txt
- Розмір:
- 817 B
- Формат:
- Item-specific license agreed upon to submission
- Опис: