On the complexity of finite semigroups
From MaRDI portal
Publication:1212108
DOI10.1016/0022-4049(74)90046-2zbMath0293.20049OpenAlexW1991777370MaRDI QIDQ1212108
Publication date: 1974
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-4049(74)90046-2
Related Items
Embedding of regular semigroups in wreath products. III, The synthesis theorem for finite regular semigroups, and its generalization, Unambiguous Büchi automata., An upper bound for the complexity of transformation semigroups, The kernel of monoid morphisms, On the syntactic transformation semigroup of a language generated by a finite biprefix code, An effective lower bound for group complexity of finite semigroups and automata, BRET TILSON: HIS LIFE AND WORK, On the complexity of finite semigroups, A reduction theorem for complexity of finite semigroups, Finite semigroup varieties of the form V*D, Inverse semigroups and extensions of groups by semilattices, Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism, Categories as algebra: An essential ingredient in the theory of monoids, The complexity of economic decision rules, Aperiodic homomorphisms and the concatenation product of recognizable sets, Pointlike sets: the finest aperiodic cover of a finite semigroup, CATEGORIES AS ALGEBRA, II, Semigroup expansions using the derived category, kernel, and Malcev products, Embedding of regular semigroups in wreath products
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of finite semigroups
- Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
- Complexity of finite semigroups
- Decomposition and complexity of finite semigroups
- Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
- The fundamental lemma of complexity for arbitrary finite semigroups
