加载中…
Let be the plactic-like monoid obtained by factoring the free monoid over a finite alphabet by the meet of the stalactic congruence and its dual. In this paper, we prove that can be equipped with multiple involutions, and divide these involutions into types. A faithful representation of under each of these involutions is obtained. We give transparent combinatorial characterizations of identities for under each involution, and so the finite basis problem and identity checking problem for them are solved.

生成讲解博客的中文版本

生成AI智能校验的中文版本