Lower bounds for complexity of finite semigroups

DOI10.1016/0022-4049(71)90012-0zbMath0259.20051OpenAlexW2013611695MaRDI QIDQ2560324

Bret Tilson, John L. Rhodes

Publication date: 1971

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(71)90012-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General structure theory for semigroups (20M10) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (21)

INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY ⋮ PROFINITE METHODS IN SEMIGROUP THEORY ⋮ The fundamental lemma of complexity for arbitrary finite semigroups ⋮ Product expansions ⋮ Lower bounds for the \(\pi\)-length of (finite) \(\pi\)-solvable semigroups ⋮ The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs ⋮ John Rhodes and the theory of finite semigroups. ⋮ An effective lower bound for group complexity of finite semigroups and automata ⋮ Studies in the Representation Theory of Finite Semigroups ⋮ BRET TILSON: HIS LIFE AND WORK ⋮ A PROFINITE APPROACH TO STABLE PAIRS ⋮ Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids ⋮ Finite binary relations have no more complexity than finite functions ⋮ Zig-zag representations and inverse semigroups ⋮ \(\pi\)-length of union of groups semigroups ⋮ Krohn-Rhodes complexity pseudovarieties are not finitely based ⋮ Kernel systems - a global study of homomorphisms on finite semigroups ⋮ The complexity of economic decision rules ⋮ The group-theoretic complexity of subsemigroups of Boolean matrices ⋮ Decomposition and complexity of finite semigroups ⋮ Improved lower bounds for the complexity of finite semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of finite semigroups
• Some results on finite semigroups
• Methods of the algebraic theory of machines. I: Decomposition theorem for generalized machines; properties preserved under series and parallel compositions of machines
• Cascade synthesis of finite-state machines
• Complexity of ideals in finite semigroups and finite-state machines
• A homomorphism theorem for finite semigroups

This page was built for publication: Lower bounds for complexity of finite semigroups