Sciweavers

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

6

STACS
2005
Springer

favoriteEmaildiscussreport

108views Theoretical Computer Science» more STACS 2005»

Minimizing NFA's and Regular Expressions

13 years 9 months ago

Minimizing NFA's and Regular Expressions

Download www.thi.informatik.uni-frankfurt.de

Gregor Gramlich, Georg Schnitger

Real-time Traffic

STACS 2005 | Theoretical Computer Science |

claim paper

Related Content

» A Regular Expression Matching Circuit Based on a Decomposed Automaton

» Explicitly Parallel Regular Expressions

» Spacetime tradeoff in regular expression matching with semideterministic finite automata

» Highspeed regular expression matching engine using multicharacter NFA

» Inductive bases and their application to searches for minimal unary NFAs

» iNFAnt NFA pattern matching on GPGPU devices

» Fast BitParallel Matching for Network and Regular Expressions

» Hardware implementation for scalable lookahead Regular Expression detection

» Small NFAs from Regular Expressions Some Experimental Results

» Three New Algorithms for Regular Language Enumeration

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	STACS
Authors	Gregor Gramlich, Georg Schnitger

Comments (0)