𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New decision algorithms for finitely presented commutative semigroups

✍ Scribed by A.M. Ballantyne; D.S. Lankford

Book ID
108020079
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
544 KB
Volume
7
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the construction of mat
An algorithm for the construction of matrix representationsfor finitely presented non-commutative algebras
✍ Gilles LabontΓ© πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 730 KB

Let a finite presentation be given for an associative, in general non-commulative algebra E, with identity, over a field. We study an algorithm for the construction, from this presentation, of linear, i.e, matrix, representations of this algebra. A set of vector constraints which is given as part of

Algorithmic Problems for Amalgams of Fin
Algorithmic Problems for Amalgams of Finite Semigroups
✍ 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