Subsemigroups and complexity via the presentation lemma
From MaRDI portal
Publication:1899162
DOI10.1016/0022-4049(94)00063-OzbMath0836.20081WikidataQ124910146 ScholiaQ124910146MaRDI QIDQ1899162
Karsten Henckell, Beverly Austin, Chrystopher L. Nehaniv, John L. Rhodes
Publication date: 16 April 1996
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
complexityidempotentsfinite semigroupsKrohn-Rhodes decomposition theoremPresentation Lemmaregular \(\mathcal J\)-classesalternating wreath product of groups and finite aperiodic semigroups
General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05)
Related Items
ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS ⋮ On calculating the Krohn-Rhodes decomposition of automata ⋮ From relation to emulation: The covering lemma for transformation semigroups ⋮ On the Dowling and Rhodes lattices and wreath products ⋮ Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples ⋮ On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. ⋮ An effective lower bound for group complexity of finite semigroups and automata ⋮ WHAT ARE MODULES? AN OVERVIEW OF BRET TILSON'S PAPER "MODULES" FROM A GEOMETRIC VIEWPOINT ⋮ HOLONOMY EMBEDDING OF ARBITRARY STABLE SEMIGROUPS ⋮ Krohn-Rhodes complexity pseudovarieties are not finitely based ⋮ COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY ⋮ On complete systems of automata ⋮ UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
Cites Work
