1. A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms. Addison-Wesley (1976).
2. An optimal lower bound for nonregular languages
3. G. Brassard and P. Bratley,Fundamentals of Algorithmics. Prentice Hall (1996).
4. Finite automata and unary languages
5. V. Geffert, (Non)determinism and the size of one-way finite automata, inProc. Descr. Compl. Formal Syst.IFIP & Univ. Milano (2005) 23–37.