Research_Papers

Efficient Submatch Addressing for Regular Expressions - Master's thesis of Ville Laurikari, Helsinki University of Technology. [PDF]
NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions - By Ville Laurikari, Helsinki University of Technology. [PDF]
Regular Expressions - A Graphical User Interface - By Dr. Stefan Kahrs, University of Kent, UK. [PostScript]
Regular Expressions for Language Engineering - By Lauri Karttunen, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller.
SWYN: A Visual Representation for Regular Expressions - By Alan F. Blackwell of the University of Cambridge. [PDF]
RE-Tree: An Efficient Index Structure for Regular Expressions - By Chee-Yong Chan, Minos Garofalakis, and Rajeev Rastogi. [PDF] (2002)
Fast Regular Expression Matching using FPGAs - By Reetinder Sidhu and Viktor K. Prasanna. (2001)
Regular Expressions to DFA's using Compressed NFA's - By Chia-Hsiang Chang. [PDF] (1992)