✦ LIBER ✦

Complexity issues of checking identities in finite monoids

✍ Scribed by Ondřej Klíma

Publisher: Springer
Year: 2009
Tongue: English
Weight: 339 KB
Volume: 79
Category: Article
ISSN: 0037-1912
DOI: 10.1007/s00233-009-9180-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of checking identities fo

The complexity of checking identities for finite matrix rings

✍ Csaba Szabó; Vera Vértesi 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 201 KB

Complexity of the identity checking prob

Complexity of the identity checking problem for finite semigroups

✍ J. Almeida; M. V. Volkov; S. V. Goldberg 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 230 KB

Computational Complexity of Checking Ide

Computational Complexity of Checking Identities in 0-Simple Semigroups and Matrix Semigroups over Finite Fields

✍ Steve Seif; Csaba Szabo 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 354 KB

Checking quasi-identities in a finite se

Checking quasi-identities in a finite semigroup may be computationally hard

✍ M. V. Volkov 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 165 KB

Generic Complexity of Finitely Presented

Generic Complexity of Finitely Presented Monoids and Semigroups

✍ Mark Kambites 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 313 KB

Complex Representations of Finite Monoid

Complex Representations of Finite Monoids II. Highest Weight Categories and Quivers

✍ Mohan S Putcha 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 272 KB

In this paper we continue our study of complex representations of finite monoids. We begin by showing that the complex algebra of a finite regular monoid is a quasi-hereditary algebra and we identify the standard and costandard modules. We define the concept of a monoid quiver and compute it in term