An upper bound for the complexity of transformation semigroups

DOI10.1016/0021-8693(81)90332-XzbMATH Open0469.20037MaRDI QIDQ1156883FDOQ1156883

Authors: S. W. Margolis, Bret Tilson 

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)

Cites Work

• Title not available (Why is that?)
• On the complexity of finite semigroups
• Kernel systems - a global study of homomorphisms on finite semigroups
• k-transformation semigroups and a conjecture of Tilson

Cited In (6)

• BRET TILSON: HIS LIFE AND WORK
• Degree 2 transformation semigroups as continuous maps on graphs: foundations and structure
• Complexity of shift spaces on semigroups
• SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
• Lower bounds on words separation: are there short identities in transformation semigroups?
• An effective lower bound for group complexity of finite semigroups and automata

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

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