1. Aho, A.V.: Algorithms for finding patterns in strings. In: Leeuwen, J.V. (ed.) Handbook of theoretical computer science, Elsevier Science Pub., Amsterdam (1990)
2. Bruggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci. 120, 197–213 (1993)
3. Chang, C.H., Paige, R.: From regular expressions to DFA’s using compressed NFA’s. Theoret. Comput. Sci. 178, 1–36 (1997)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, New York (1979)
5. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory language and computation. Addison Wesley, Reading (1979)