✦ LIBER ✦

Complexity of the word problem for commutative semigroups of fixed dimension

✍ Scribed by Dung T. Huynh

Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 578 KB
Volume: 22
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00288776

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Identity problem for quasiregular algebr

Identity problem for quasiregular algebras over commutative semigroups and commutative semigroups of languages

✍ V. N. Rel'ko; L. P. Lisovik 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 313 KB

A solution of the word problem for free

A solution of the word problem for free ∗-regular semigroups

✍ Libor Polák 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 102 KB

leads to canonical forms representing elements of the free \* -regular semigroup.

The complexity of the word problem for a

The complexity of the word problem for abelian l-groups

✍ Volker Weispfenning 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 365 KB

A fixed-space program of linear output c

A fixed-space program of linear output complexity for the problem of the three vessels

✍ Martin Rem; Young-il Choo 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 518 KB

An upper bound for the complexity of tra

An upper bound for the complexity of transformation semigroups

✍ Stuart W Margolis; Bret Tilson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 759 KB

The uniform word problem for groups and

The uniform word problem for groups and finite Rees quotients of E-unitary inverse semigroups

✍ Benjamin Steinberg 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 133 KB

If C is a class of groups closed under taking subgroups, we show that the decidability of the uniform word problem for C is implied by the decidability of the membership problem for the class of finite Rees quotients of E-unitary inverse semigroups with maximal group image in C. The converse is show