Decidability of complexity one-half for finite semigroups
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3685750 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Decomposition and 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
- Improved lower bounds for the complexity of finite semigroups
- Kernel systems - a global study of homomorphisms on finite semigroups
Cited in
(15)- 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.
- On a conjecture of Rhodes
- COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY
- The semilattices of nilextensions of left groups and their varieties
- On All Things Star-Free
- Reduction theorem for the type-II conjecture for finite monoids
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- Some reducibility properties for pseudovarieties of the form \(DRH\)
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- On semidirect products of two finite semilattices
- On the pseudovariety generated by all finite monoids satisfying \(\mathcal R=\mathcal H\).
- Profinite topologies
- An effective lower bound for group complexity of finite semigroups and automata
- STABLE PAIRS
This page was built for publication: Decidability of complexity one-half for finite semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173164)
