Web Directory

» Efficient Submatch Addressing for Regular Expressions
   Master's thesis of Ville Laurikari, Helsinki University of Technology.
   http://laurikari.net/ville/regex-submatch.pdf

» Fast Regular Expression Matching using FPGAs
   By Reetinder Sidhu and Viktor K. Prasanna.
   http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.730

» NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions
   By Ville Laurikari, Helsinki University of Technology.
   http://laurikari.net/ville/spire2000-tnfa.pdf

» RE-Tree: An Efficient Index Structure for Regular Expressions
   By Chee-Yong Chan, Minos Garofalakis, and Rajeev Rastogi.
   http://www.vldb.org/conf/2002/S08P02.pdf

» Regular Expressions - A Graphical User Interface
   By Dr. Stefan Kahrs, University of Kent, UK. [PostScript]
   http://www.cs.kent.ac.uk/people/staff/smk/regexp.ps

» Regular Expressions for Language Engineering
   By Lauri Karttunen, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller.
   http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.4880

» Regular Expressions to DFA's using Compressed NFA's
   By Chia-Hsiang Chang.
   http://www.cs.nyu.edu/csweb/Research/Theses/chang_chia-hsiang.pdf

» SWYN: A Visual Representation for Regular Expressions
   By Alan F. Blackwell of the University of Cambridge.
   http://www.cl.cam.ac.uk/~afb21/publications/yourwish.pdf