2022/04/20 by Karsten Henckell, Henckell, Karsten, Samuel Herman +1
Computer Science · Mathematics · #semigroups and automata theory #Advanced Algebra and Logic #Geometric and Algebraic Topology
paper · pdf · doi:10.48550/arxiv.2204.09247
We show that pointlike sets are decidable for the pseudovariety of finite semigroups whose idempotent-generated subsemigroup is R-trivial. Notably, our proof is constructive: we provide an explicit relational morphism which computes the ER-pointlike subsets of a given finite semigroup.