1. Aho, A. V.; Sethi, R.; Ullman, J.D. (1985). Compilers: principles, techniques and tools. Addison-Wesley, Reading, MA.
2. Daciuk, J.; Mihov, S.; Watson, B.W.; Watson, R.E. (2000). Incremental construction of minimal acyclic finite-state automata. Computational Linguistics, vol. 26(1), pp. 3–16.
3. Graña Gil, J. (2000). Robust parsing techniques for natural language tagging (in Spanish). PhD. Thesis, Departamento de Computación, Universidad de La Coruña (Spain).
4. Hopcroft, J.E.; Ullman, J.D. (1979). Introduction to automata theory, languages and computations. Addison-Wesley, Reading, MA.
5. Lucchesi, C. L.; Kowaltowski, T. (1993). Applications of finite automata representing large vocabularies. Software-Practice and Experience, vol. 23(1), pp. 15–30.