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