A reduction theorem for complexity of finite semigroups

DOI10.1007/BF02194878MaRDI QIDQ1216474zbMATH OpenOpenAlexFDO

Authors John L. Rhodes, Bret Tilson

Publication date 1975

Published in Semigroup Forum (Search for Journal in Brave)

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

Mathematics Subject Classification ID

General structure theory for semigroups (20M10)

Cites work

• A generalization of the Rees theorem to a class of regular semigroups
• Decomposition and complexity of finite semigroups
• Finite binary relations have no more complexity than finite functions
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3308368 (Why is no real title available?)
• Kernel systems - a global study of homomorphisms on finite semigroups
• On the complexity of finite semigroups

Cited in

(5)

• The synthesis theorem for finite regular semigroups, and its generalization
• Kernel systems - a global study of homomorphisms on finite semigroups
• BRET TILSON: HIS LIFE AND WORK
• Krohn-Rhodes complexity pseudovarieties are not finitely based
• An effective lower bound for group complexity of finite semigroups and automata

This page was built for publication: A reduction theorem for complexity of finite semigroups

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