1. Almeida, J.: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics. Algebra Universalis 27, 333–350 (1990)
2. Bernátsky, L.: Regular expression star-freeness is PSPACE-complete. Acta Cybernetica 13, 1–21 (1997)
3. Cho, S., Huynh, D.T.: Finite-automaton aperiodicity is PSPACE-complete. Theoretical Computer Science 88, 99–116 (1991)
4. Eilenberg, S.: Automata, Languages, and Machines, vol. A&B. Academic Press, London (1974)
5. Ésik, Z.: Definite tree automata and their cascade compositions. Publ. Math. 48, 243–262 (1996)