Which Kleene semigroups are finite?

DOI10.1016/0304-3975(91)90162-UzbMath0741.20054OpenAlexW2038148980MaRDI QIDQ1178693

C. P. Rupert

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90162-u

zbMATH Keywords

idempotentsGreen relationssimple semigroupsperiodic semigrouprecognizable setssyntactic congruencenil semigroupsrational setband of Archimedean semigroupsband of left- cancellative semigroupsKleene semigroup

Mathematics Subject Classification ID

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

Related Items

Slightly commutative Kleene semigroups ⋮ A finiteness criterion for inverse semigroups ⋮ Anisimov's Theorem for inverse semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Easy multiplications. II: Extensions of rational semigroups
• Easy multiplications. I: The realm of Kleene's theorem
• On finiteness conditions in semigroups
• Equidivisible Kleene monoids and the Elgot-Mezei theorem
• Structure of regular semigroups. I