Pages that link to "Item:Q2549042"
From MaRDI portal
The following pages link to Decomposition and complexity of finite semigroups (Q2549042):
Displaying 22 items.
- Categories as algebra: An essential ingredient in the theory of monoids (Q581545) (← links)
- On varieties of rational languages and variable length codes. II (Q1079669) (← links)
- A note on endomorphism semigroups (Q1145774) (← links)
- Decidability of complexity one-half for finite semigroups (Q1173164) (← links)
- On the complexity of finite semigroups (Q1212108) (← links)
- Finite binary relations have no more complexity than finite functions (Q1212557) (← links)
- \(\pi\)-length of union of groups semigroups (Q1215019) (← links)
- The kernel of a homomorphism on a finite semigroup (Q1215718) (← links)
- A reduction theorem for complexity of finite semigroups (Q1216474) (← links)
- Sur le produit de concatenation non ambigu (Q1244582) (← links)
- Kernel systems - a global study of homomorphisms on finite semigroups (Q1247497) (← links)
- The group-theoretic complexity of subsemigroups of Boolean matrices (Q1255585) (← links)
- Lower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroups (Q1393613) (← links)
- On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. (Q1421252) (← links)
- Decomposition and complexity of finite semigroups (Q2549042) (← links)
- Locally testable languages (Q2554236) (← links)
- Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
- BRET TILSON: HIS LIFE AND WORK (Q3561114) (← links)
- Group-complexity and reversals of finite semigroups (Q4106789) (← links)
- Krohn-Rhodes complexity pseudovarieties are not finitely based (Q4680740) (← links)
- An effective lower bound for group complexity of finite semigroups and automata (Q5389413) (← links)
- Studies in the Representation Theory of Finite Semigroups (Q5635622) (← links)
