Pages that link to "Item:Q5389413"
From MaRDI portal
The following pages link to An effective lower bound for group complexity of finite semigroups and automata (Q5389413):
Displaying 7 items.
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words (Q2232291) (← links)
- Pro-aperiodic monoids via saturated models (Q2279939) (← links)
- John Rhodes and the theory of finite semigroups. (Q2447219) (← links)
- Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
- Pointlike sets for varieties determined by groups (Q2631933) (← links)
- Degree 2 transformation semigroups as continuous maps on graphs: Foundations and structure (Q4957768) (← links)
- Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples (Q6043405) (← links)