✦ LIBER ✦

Algorithmic Problems for Amalgams of Finite Semigroups: Volume 229, Number 2 (2000), pages 514–531

✍ Scribed by Mark V. Sapir

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 127 KB
Volume: 232
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.2000.8559

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that there exists an amalgam of two finite 4-nilpotent semigroups such that the corresponding amalgamated product has an undecidable word problem. We also show that the problem of embeddability of finite semigroup amalgams in any semigroups and the problem of embeddability of finite semigroup amalgams into finite semigroups are undecidable. We use several versions of Minsky algorithms and Slobodskoj's result about undecidability of the universal theory of finite groups.