Decomposition and complexity of finite semigroups

DOI10.1007/BF02572961zbMATH Open0226.20060OpenAlexW2007062491MaRDI QIDQ2549042FDOQ2549042

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

• Title not available (Why is that?)
• Improved lower bounds for the complexity of finite semigroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Decomposition and complexity of finite semigroups
• Complexity of finite semigroups
• Title not available (Why is that?)
• A homomorphism theorem for finite semigroups
• Some results on 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
• Complexity of ideals in finite semigroups and finite-state machines
• 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
• BRET TILSON: HIS LIFE AND WORK
• On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties.
• Categories as algebra: An essential ingredient in the theory of monoids
• A note on endomorphism semigroups
• Group-complexity and reversals of finite semigroups
• On the complexity of finite semigroups
• Kernel systems - a global study of homomorphisms on finite semigroups
• Krohn-Rhodes complexity pseudovarieties are not finitely based
• Decomposition and complexity of finite semigroups
• An effective lower bound for group complexity of finite semigroups and automata
• Locally testable languages
• Decidability of complexity one-half for finite semigroups
• 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
• Studies in the Representation Theory of Finite Semigroups
• Finite binary relations have no more complexity than finite functions

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)