2007/06/02 by Karsten Henckell, Henckell, Karsten, John Rhodes +3
Computer Science · Mathematics · #20M07 #Advanced Algebra and Logic #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0706.0248
openalex publication_date 2007/06/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove that if π is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are π-groups. In particular, when π is the empty set, we obtain Henckell's decidability of aperiodic pointlikes. Our proof, restricted to the case of aperiodic semigroups, is simpler than the original proof.