Finitely generated permutative varieties. (Q2391163)

A permutation identity is an identity of the form \(x_1x_2\cdots x_n=x_{1\pi}x_{2\pi}\cdots x_{n\pi}\) where \(\pi\) is a non-trivial permutation of \(\{1,2,\dots,n\}\). The author presents an algorithm that, given a finite set \(\Sigma\) of semigroup identities containing a permutation identity, decides whether the variety defined by \(\Sigma\) is generated by a finite semigroup (Theorem~5). This answers a question by the reviewer and extends an earlier result by the author [Mat. Zap. 14, No. 3, 112-119 (1988; Zbl 0685.20041)] for \(\Sigma\) containing the commutative law.