The synthesis theorem for finite regular semigroups, and its generalization
From MaRDI portal
Publication:1110661
DOI10.1016/0022-4049(88)90040-0zbMath0657.20050MaRDI QIDQ1110661
Publication date: 1988
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-4049(88)90040-0
regular semigroups; finite semigroup; unions of groups; unambiguous semigroup; Extensions of matrix semigroups; finite iterative structure-matrix semigroup; synthesis theorem; unambiguous expansion
20M10: General structure theory for semigroups
20M20: Semigroups of transformations, relations, partitions, etc.
20M15: Mappings of semigroups
Related Items
IDEALS AND FINITENESS CONDITIONS FOR SUBSEMIGROUPS, Almost finite expansions of arbitrary semigroups, Iteration of expansions. Unambiguous semigroups, Arbitrary vs. regular semigroups, On Birget's regular embedding, On calculating the Krohn-Rhodes decomposition of automata, Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem, Finite aperiodic semigroups with commuting idempotents and generalizations, FURTHER RESULTS ON MONOIDS ACTING ON TREES
Cites Work
- Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
- Categories as algebra: An essential ingredient in the theory of monoids
- Almost finite expansions of arbitrary semigroups
- Iteration of expansions. Unambiguous semigroups
- Arbitrary vs. regular semigroups
- A short proof that \(\hat S^+_ A\) is finite if S is finite
- On the complexity of finite semigroups
- A reduction theorem for complexity of finite semigroups
- Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem
- A generalization of the Rees theorem to a class of regular semigroups
- Stability and J-depth of expansions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
