Decidability of complexity one-half for finite semigroups
From MaRDI portal
Publication:1173164
DOI10.1007/BF02572755zbMath0503.20028OpenAlexW2076254032MaRDI QIDQ1173164
Publication date: 1982
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/134535
regular elementsnilpotent idealsdecomposition theorems for finite semigroupsfinite aperiodic semigroup
Related Items
Some reducibility properties for pseudovarieties of the form DRH, On a conjecture of Rhodes, Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$, 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, STABLE PAIRS, On the pseudovariety generated by all finite monoids satisfying \(\mathcal R=\mathcal H\)., On All Things Star-Free, Profinite topologies, The semilattices of nilextensions of left groups and their varieties, COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY, On semidirect products of two finite semilattices, Reduction theorem for the type-II conjecture for finite monoids, HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS, UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
Cites Work
- Unnamed Item
- Unnamed Item
- Kernel systems - a global study of homomorphisms on finite semigroups
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Decomposition and complexity of finite semigroups
- Improved lower bounds for the complexity of finite semigroups
- Global structure theories for finite semigroups. Introduction. I: Extension of the fundamental theorem of finite semigroups. II: Axioms for complexity for all finite semigroups. III: Complexity of two-\(J\) class semigroups. IV: Synthesis of the classical and modern theory of finite semigroups
