Decomposition and complexity of finite semigroups

DOI10.1007/BF02572961MaRDI QIDQ2549042zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3353593 (Why is no real title available?)
• A homomorphism theorem for finite semigroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Complexity of finite semigroups
• Complexity of ideals in finite semigroups and finite-state machines
• Decomposition and complexity of finite semigroups
• Improved lower bounds for the complexity of finite semigroups
• Lower bounds for complexity of finite semigroups
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• Some results on finite semigroups
• The fundamental lemma of complexity for arbitrary finite semigroups

Cited in

(22)

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

This page was built for publication: Decomposition and complexity of finite semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2549042)