✦ LIBER ✦

On Algorithmic Problems for Joins of Pseudovarieties

✍ Scribed by B. Steinberg

Book ID: 120761040
Publisher: Springer
Year: 2001
Tongue: English
Weight: 326 KB
Volume: 62
Category: Article
ISSN: 0037-1912
DOI: 10.1007/PL00020979

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The finite basis problem in the pseudova

The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups

✍ P. G. Trotter; M. V. Volkov 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 451 KB

On the membership problem for pseudovari

On the membership problem for pseudovarieties of commutative semigroups

✍ Jorge Almeida 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 243 KB

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

On some algorithmic problems of multicri

On some algorithmic problems of multicriterion optimization on graphs

✍ V.A. Emelichev; V.A. Perepelitsa 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 983 KB

Implications of forbidden structures for

Implications of forbidden structures for extremal algorithmic problems

✍ Ming-Deh A. Huang; Karl J. Lieberherr 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 884 KB

Undecidability of certain algorithmic pr

Undecidability of certain algorithmic problems for Lie algebras

✍ L. A. Bokut’ 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 420 KB