An upper bound for the complexity of transformation semigroups

DOI10.1016/0021-8693(81)90332-XzbMath0469.20037MaRDI QIDQ1156883

Bret Tilson, Stuart W. Margolis

Publication date: 1981

Published in: Journal of Algebra (Search for Journal in Brave)

zbMATH Keywords

transformation monoidcomplexity of relational morphism of semigroupscomplexity of transformation semigroups

Mathematics Subject Classification ID

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

Related Items (3)

An effective lower bound for group complexity of finite semigroups and automata ⋮ BRET TILSON: HIS LIFE AND WORK ⋮ Degree 2 transformation semigroups as continuous maps on graphs: Foundations and structure

Cites Work

• Unnamed Item
• k-transformation semigroups and a conjecture of Tilson
• On the complexity of finite semigroups
• Kernel systems - a global study of homomorphisms on finite semigroups

This page was built for publication: An upper bound for the complexity of transformation semigroups