Decomposition and complexity of finite semigroups

DOI10.1007/BF02572961zbMath0226.20060OpenAlexW2007062491MaRDI QIDQ2549042

Bret Tilson

Publication date: 1971

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133863

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20)

Related Items

On varieties of rational languages and variable length codes. II, Lower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroups, A note on endomorphism semigroups, On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties., Decidability of complexity one-half for finite semigroups, An effective lower bound for group complexity of finite semigroups and automata, Studies in the Representation Theory of Finite Semigroups, BRET TILSON: HIS LIFE AND WORK, Group-complexity and reversals of finite semigroups, On the complexity of finite semigroups, Finite binary relations have no more complexity than finite functions, \(\pi\)-length of union of groups semigroups, The kernel of a homomorphism on a finite semigroup, A reduction theorem for complexity of finite semigroups, Krohn-Rhodes complexity pseudovarieties are not finitely based, Categories as algebra: An essential ingredient in the theory of monoids, Sur le produit de concatenation non ambigu, Kernel systems - a global study of homomorphisms on finite semigroups, The group-theoretic complexity of subsemigroups of Boolean matrices, Decomposition and complexity of finite semigroups, Locally testable languages, Improved lower bounds for the complexity of finite semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
• Complexity of finite semigroups
• Some results on finite semigroups
• Decomposition and complexity of finite semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• Improved lower bounds for the complexity of finite semigroups
• Lower bounds for complexity of finite semigroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Complexity of ideals in finite semigroups and finite-state machines
• The fundamental lemma of complexity for arbitrary finite semigroups
• A homomorphism theorem for finite semigroups