1. Some descriptional complexity problems in finite automata theory;Adorna,2005
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. A very hard log-space counting class;Álvarez;Theoret. Comput. Sci.,1993
4. Σ11 formulae on finite structures;Ajtai;Ann. Pure. Appl. Logic,1983
5. FA minimisation heuristics for a class of finite languages;Amilhastre,2001