1 citations · 2 across the 2 of their papers we have counts for
2 papers
math.GR2007★ 1 cited
Aperiodic Pointlikes and Beyond
Karsten Henckell, John Rhodes, Benjamin Steinberg
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…
math.GR2006★ 1 cited
A Profinite Approach to Stable Pairs
Karsten Henckell, John Rhodes, Benjamin Steinberg
We give a short proof, using profinite techniques, that idempotent pointlikes, stable pairs and triples are decidable for the pseudovariety of aperiodic monoids. Stable pairs are a…