Sciweavers

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

7

CPM
1992
Springer

favoriteEmaildiscussreport

97views Combinatorics» more CPM 1992»

From Regular Expressions to DFA's Using Compressed NFA's

13 years 9 months ago

From Regular Expressions to DFA's Using Compressed NFA's

Download www.cs.nyu.edu

Chia-Hsiang Chang, Robert Paige

Real-time Traffic

Combinatorics | CPM 1992 |

claim paper

Related Content

» Spacetime tradeoff in regular expression matching with semideterministic finite automata

» Explicitly Parallel Regular Expressions

» Hardware implementation for scalable lookahead Regular Expression detection

» Reorganized and Compact DFA for Efficient Regular Expression Matching

» Compact DFA Representation for Fast Regular Expression Search

» Regular Expression Software Deceleration for Intrusion Detection Systems

» Curing regular expressions matching algorithms from insomnia amnesia and acalculia

» Advanced algorithms for fast and scalable deep packet inspection

» Algorithms to accelerate multiple regular expressions matching for deep packet inspection

» Compiling PCRE to FPGA for accelerating SNORT IDS

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	CPM
Authors	Chia-Hsiang Chang, Robert Paige

Comments (0)