Abstract
We present an algorithm to compute the pointlike subsets of a finite semigroup with respect to the pseudovariety R of all finite R -trivial semigroups. The algorithm is inspired by Henckell’s algorithm for computing the pointlike subsets with respect to the pseudovariety of all finite aperiodic semigroups. We also give an algorithm to compute J -pointlike sets, where J denotes the pseudovariety of all finite J -trivial semigroups. We finally show that, in contrast with the situation for R , the natural adaptation of Henckell’s algorithm to J computes pointlike sets, but not all of them.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
