Research Papers
Efficient Submatch Addressing for Regular Expressions
Master's thesis of Ville Laurikari, Helsinki University of Technology.
Fast Regular Expression Matching using FPGAs
By Reetinder Sidhu and Viktor K. Prasanna.
NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions
By Ville Laurikari, Helsinki University of Technology.
RE-Tree: An Efficient Index Structure for Regular Expressions
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
By Lauri Karttunen, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller. [PostScript]
SWYN: A Visual Representation for Regular Expressions
By Alan F. Blackwell of the University of Cambridge.
Showing 20–10 of 10 results