Regular expressions are text strings formed in a particular syntax that is used in various tools and programming languages for searching text patterns within text. The sites in this section focus on research about various aspects of regular expressions.
Sites 11
Loading new listings for you to review...
- Efficient Submatch Addressing for Regular Expressions Master thesis of Ville Laurikari. Proposes algorithm for submatch addressing.
- NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions Article by Ville Laurikari.
- SWYN: A Visual Representation for Regular Expressions Article by Alan F. Blackwell. Discusses approach for constructing regexps from examples.
- New Techniques for Regular Expression Searching Article by Gonzalo Navarro and Mathieu Raffinot. Presents two techniques for regex searching.
- Structural Regular Expressions Article by Rob Pike. Discusses the use of regex to describe the structure of files.
- Fast Regular Expression Matching using FPGAs Article by Reetinder Sidhu and Viktor K. Prasanna. Discusses matching methods using Field Programmable Gate Arrays.
- Regular Expressions for Language Engineering Article by Lauri Karttunen, Jean-Pierre Chanod, Gregory Grefenstette and Anne Schiller. Introduces regular expression calculus.
- Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection Article by multiple authors. Introduces the delayed input DFA, an alternate regular expression representation.
- Approximate Matching of Regular Expressions Article by Eugene W. Myers and W. Miller. Presents a best-match algorithm.
- Implementing Regular Expressions Collection of research articles about efficient regular expression engines. Features article description, links to libraries.
- Regular Expressions to DFAs using Compressed NFAs Article by Chia-Hsiang Chang.