Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ICALP
2004
Springer

favoriteEmaildiscussreport

97views Programming Languages» more ICALP 2004»

Greedy Regular Expression Matching

13 years 10 months ago

Greedy Regular Expression Matching

Download lucacardelli.name

This paper studies the problem of matching sequences against regular expressions in order to produce structured values.

Alain Frisch, Luca Cardelli

Real-time Traffic

ICALP 2004 | Regular Expressions | Structured Values | Theoretical Computer Science |

claim paper

Related Content

» Spacetime tradeoff in regular expression matching with semideterministic finite automata

» Compiling PCRE to FPGA for accelerating SNORT IDS

» Randomized greedy algorithms for independent sets and matchings in regular graphs Exact re...

» Reporting Exact and Approximate Regular Expression Matches

» Improved Approximate String Matching and Regular Expression Matching on ZivLempel Compress...

» Regular Expression Matching on Graphics Hardware for Intrusion Detection

» Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions

» Regular Expression Matching in Reconfigurable Hardware

» Regular expression pattern matching for XML

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ICALP
Authors	Alain Frisch, Luca Cardelli

Comments (0)