A reduction theorem for complexity of finite semigroups

DOI10.1007/BF02194878zbMath0303.20042OpenAlexW1992030135MaRDI QIDQ1216474

Bret Tilson, John L. Rhodes

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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of finite semigroups
• Finite binary relations have no more complexity than finite functions
• Kernel systems - a global study of homomorphisms on finite semigroups
• Decomposition and complexity of finite semigroups
• A generalization of the Rees theorem to a class of regular semigroups

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