1. Programming techniques: Regular expression search algorithm;Thompson;Communications of the ACM,1968
2. Cox R. Regular expression matching can be simple and fast. http://swtch.com/∼rsc/regexp/regexp1.html [20 June 2008].
3. NFAs with tagged transitions, their conversion to deterministic automata and application to regular expressions
4. Laurikari V. TRE matching library. http://laurikari.net/tre/ [20 June 2008].
5. Fowler G. An interpretation of the POSIX regex standard. http://www.research.att.com/∼gsf/testregex/re-interpretation.html [20 June 2008].