HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES
Ondřej Klíma, Libor Polák · International Journal of Foundations of Computer Science · 2010
The classes of languages which are Boolean combinations of languages of the form [Formula: see text] for a fixed k ≥ 0, form a natural hierarchy within piecewise testable languages and have been studied by Simon, Blanchet-Sadri, Volkov and others. The main issues were the existence of finite bases of identities for the corresponding pseudovarieties of monoids and monoids generating these pseudovarieties. Here we deal with similar questions concerning the finite unions and positive Boolean combinations of the languages of the form above. In the first case the corresponding pseudovarieties are given by a single identity, in the second case there are finite bases for k equals to 1 and 2 and there is no finite basis for k ≥ 4 (the case k = 3 remains open). All the pseudovarieties are generated by a single algebraic structure.