共 50 条
Non-finitely based monoids
被引:22
|作者:
Sapir, Olga
机构:
关键词:
Finite basis problem;
Semigroups;
Monoids;
Piecewise testable languages;
DOT-DEPTH ONE;
BASIS QUESTION;
VARIETIES;
SEMIGROUPS;
WORDS;
EQUATIONS;
D O I:
10.1007/s00233-015-9708-2
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We present a general method for proving that a semigroup is non-finitely based (NFB). The method is strong enough to cover a majority of existing non-finite basis arguments for a periodic semigroups and allows to generalize several previous results and to simplify their proofs. The method also allows to remove one of the requirements on the "special system of identities" used by Perkins in 1968 to find the first two examples of finite NFB semigroups. We use our method to prove eleven new sufficient conditions under which a monoid is NFB. As an application, we find infinitely many new examples of finite finitely based aperiodic monoids whose direct product is NFB.
引用
收藏
页码:557 / 586
页数:30
相关论文