Algorithmic Problems for Amalgams of Fin
✍
Mark V. Sapir
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 118 KB
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 semigro