Efficient Submatch Addressing for Regular Expressi
Master's thesis of Ville Laurikari, Helsinki University of Technology.
Fast Regular Expression Matching using FPGAs
By Reetinder Sidhu and Viktor K. Prasanna.
Fast Regular Expression Search
By Gonzalo Navarro and Mathieu Raffinot. [PostScript]
NFAs with Tagged Transitions, their Conversion to
By Ville Laurikari, Helsinki University of Technology.
RE-Tree: An Efficient Index Structure for Regular
By Chee-Yong Chan, Minos Garofalakis, and Rajeev Rastogi.
Regular Expression Searching on Compressed Text
By Gonzalo Navarro of the University of Chile. [PostScript]
Regular Expressions - A Graphical User Interface
By Dr. Stefan Kahrs, University of Kent, UK. [PostScript]
Regular Expressions for Language Engineering
http://citeseer.ist.psu.edu/rd/0%2C440642%2C1%2C0.25%2CDownload/http://citeseer.ist.psu.edu/cache/pa
By Lauri Karttunen, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller. [PostScript]
Regular Expressions to DFA's using Compressed
By Chia-Hsiang Chang.
SWYN: A Visual Representation for Regular Expressi
By Alan F. Blackwell of the University of Cambridge.