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
โฆ LIBER โฆ
Chapter 2. Axioms for complexity for all finite semigroups
โ Scribed by John Rhodes
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 243 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Algorithmic Problems for Amalgams of Fin
Algorithmic Problems for Amalgams of Finite Semigroups: Volume 229, Number 2 (2000), pages 514โ531
โ
Mark V. Sapir
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 127 KB
Dinuclear Metal Complexes Based on all-c
โ
Fabrizio Mancin; Enrico Rampazzo; Paolo Tecilla; Umberto Tonellato
๐
Article
๐
2004
๐
John Wiley and Sons
๐
English
โ 161 KB
Rovibronic Levels for the (1โ3)3ฮ g Manif
โ
S. Andersson; L.A. Pederson; N. Elander
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 244 KB
A one-dimensional complex scaled finite element method was applied on an adiabatic basis of B 2 in order to find rovibronic term energy values for the (1) 3 g ; (v, N ) = (0-8, 0-25) and (2) 3 g ; (v, N ) = (0-10, 0-25) levels. The method was also applied to the (1) 3 g ; (v, N ) = (0-8, 0-25) and (