Concepedia

Publication | Closed Access

APERIODIC POINTLIKES AND BEYOND

30

Citations

8

References

2010

Year

Abstract

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.

References

YearCitations

Page 1