Komplementäre Halbgruppen Kongruenzen und Quotienten
We prove that the pseudovariety of monoids of Krohn-Rhodes complexity at most is not finitely based for all . More specifically, for each pair of positive integers , we construct a monoid of complexity , all of whose -generated submonoids have complexity at most .
We prove that the pseudovariety of monoids of Krohn-Rhodes complexity at most n is not finitely based for all n>0. More specifically, for each pair of positive integers n,k, we construct a monoid of complexity n+1, all of whose k-generated submonoids have complexity at most n.