Complete κ-reducibility of pseudovarieties of the form DRH

被引:1
作者
Almeida, Jorge [1 ,2 ]
Borlido, Celia
机构
[1] Univ Porto, Ctr Matemat, Rua Campo Alegre 687, P-4169007 Oporto, Portugal
[2] Univ Porto, Fac Ciencias, Dept Matemat, Rua Campo Alegre 687, P-4169007 Oporto, Portugal
关键词
Pseudovariety; R-class; complete reducibility; SEMIDIRECT PRODUCTS; FINITE-SEMIGROUPS; UNDECIDABILITY; AUTOMATA;
D O I
10.1142/S0218196717500096
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We denote by. the implicit signature that contains the multiplication and the (omega-1)-power. It is proved that for any completely kappa-reducible pseudovariety of groups H, the pseudovariety DRH of all finite semigroups whose regular R-classes are groups in H is completely kappa-reducible as well. The converse also holds. The tools used by Almeida, Costa, and Zeitoun for proving that the pseudovariety of all finite R-trivial monoids is completely kappa-reducible are adapted for the general setting of a pseudovariety of the form DRH.
引用
收藏
页码:189 / 235
页数:47
相关论文
共 24 条
[1]   UNDECIDABILITY OF THE IDENTITY PROBLEM FOR FINITE-SEMIGROUPS [J].
ALBERT, D ;
BALDINGER, R ;
RHODES, J .
JOURNAL OF SYMBOLIC LOGIC, 1992, 57 (01) :179-192
[2]  
Almeida J, 2005, NATO SCI SER II MATH, V207, P1
[3]   Tameness of the pseudovariety of Aebelian groups [J].
Almeida, J ;
Delgado, M .
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2005, 15 (02) :327-338
[4]   Hyperdecidable pseudovarieties and the calculation of semidirect products [J].
Almeida, J .
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 1999, 9 (3-4) :241-261
[5]   Free profinite R-trivial monoids [J].
Almeida, J ;
Weil, P .
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 1997, 7 (05) :625-671
[6]   On the decidability of iterated semidirect products with applications to complexity [J].
Almeida, J ;
Steinberg, B .
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2000, 80 :50-74
[7]   The pseudoidentity problem and reducibility for completely regular semigroups [J].
Almeida, J ;
Trotter, PG .
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2001, 63 (03) :407-433
[8]   SC-hyperdecidability of R [J].
Almeida, J ;
Silva, PV .
THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) :569-591
[9]  
Almeida J., 2002, Semigroups, algorithms, automata and languages (Coimbra, 2001), P3
[10]  
Almeida J., 1994, FINITE SEMIGROUPS UN