On finite monoids having only trivial subgroups

1965/04/01 by M.P. Schützenberger, M. P. Schützenberger · 11 citations
Computer Science · Mathematics · #Advanced Topology and Set Theory #Algebra over a field #Combinatorics #Computability, Logic, AI Algorithms #Mathematics #Pure mathematics #semigroups and automata theory

paper · doi:10.1016/s0019-9958(65)90108-7

crossref issued 1965/04/01 · crossref published 1965/04/01 · crossref published-print 1965/04/01 · openalex publication_date 1965/04/01 · crossref created 2004/12/15 · crossref deposited 2019/01/31 · openalex created_date 2025/10/10 · crossref indexed 2026/06/30 · openalex updated_date 2026/06/30

Cited by

• Pro-aperiodic monoids via saturated models
• Exact Local Annotations for Regular Languages
• Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
• Minimization of Streaming Transducers
• Finite-Horizon First-Order Rank Profiles of Regular Languages
• Classification of finite monoids: the language approach
• Finite monoids and the fine structure of NC 1
• Density of rational languages under shift invariant measures
• The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
• Star height [wikipedia]
• Syntactic monoid [wikipedia]