Pages that link to "Item:Q1212108"
From MaRDI portal
The following pages link to On the complexity of finite semigroups (Q1212108):
Displaying 20 items.
- Inverse semigroups and extensions of groups by semilattices (Q579419) (← links)
- Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism (Q580507) (← links)
- Categories as algebra: An essential ingredient in the theory of monoids (Q581545) (← links)
- The kernel of monoid morphisms (Q912218) (← links)
- Embedding of regular semigroups in wreath products (Q1062147) (← links)
- Embedding of regular semigroups in wreath products. III (Q1084514) (← links)
- The synthesis theorem for finite regular semigroups, and its generalization (Q1110661) (← links)
- An upper bound for the complexity of transformation semigroups (Q1156883) (← links)
- On the syntactic transformation semigroup of a language generated by a finite biprefix code (Q1165022) (← links)
- On the complexity of finite semigroups (Q1212108) (← links)
- A reduction theorem for complexity of finite semigroups (Q1216474) (← links)
- The complexity of economic decision rules (Q1251974) (← links)
- Aperiodic homomorphisms and the concatenation product of recognizable sets (Q1257988) (← links)
- Semigroup expansions using the derived category, kernel, and Malcev products (Q1295716) (← links)
- Unambiguous Büchi automata. (Q1401292) (← links)
- Pointlike sets: the finest aperiodic cover of a finite semigroup (Q1824040) (← links)
- Finite semigroup varieties of the form V*D (Q2266068) (← links)
- BRET TILSON: HIS LIFE AND WORK (Q3561114) (← links)
- CATEGORIES AS ALGEBRA, II (Q4469599) (← links)
- An effective lower bound for group complexity of finite semigroups and automata (Q5389413) (← links)
