Affiliation:
1. New College of Florida, Division of Natural Sciences, 5700 N. Tamiami Trail, Sarasota, Fl 34243, USA
Abstract
For a finite semigroup S and pseudovariety V, (Y, T) is a V-stable pair of S iff Y ⊆ S, T ≤ S and for any relational morphism R : S ⇝ V with V ∈ V there exists a v ∈ V such that Y ⊆ R-1(v) and T ≤ R-1( Stab (v)). X ≤ S is stable if it is generated by an [Formula: see text]-chain {ai} with aiaj = ai for j < i. Given a relation R : S ⇝ A ∈ A (where A denotes the pseudovariety of aperiodic semigroups) that computes PlA(S), we construct a new relation R∞ : S ⇝ (A(M))# that computes A-stable pairs. This proves the main result of this paper: (Y, T) is an A-stable pair of S iff T ≤ ∪ X for some stableX ≤ PlA(S) and Y ⊆ Y' for some Y' ∈ PlA(S) with Y'x = Y' for all x ∈ X. As a corollary we get that if V is a local pseudovariety of semigroups, then V * A has decidable membership problem.
Publisher
World Scientific Pub Co Pte Lt
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples;International Journal of Algebra and Computation;2023-02-16
2. Pro-aperiodic monoids via saturated models;Israel Journal of Mathematics;2019-10
3. APERIODIC POINTLIKES AND BEYOND;International Journal of Algebra and Computation;2010-03
4. A PROFINITE APPROACH TO STABLE PAIRS;International Journal of Algebra and Computation;2010-03
5. Krohn-Rhodes complexity pseudovarieties are not finitely based;RAIRO - Theoretical Informatics and Applications;2005-01