Sciweavers

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

10

FOSSACS
2007
Springer

favoriteEmaildiscussreport

100views Software Engineering» more FOSSACS 2007»

An Effective Algorithm for the Membership Problem for Extended Regular Expressions

13 years 8 months ago

An Effective Algorithm for the Membership Problem for Extended Regular Expressions

Download fsl.cs.uiuc.edu

By adding the complement operator (

Grigore Rosu

Real-time Traffic

ERE Membership | ERE Membership Problem | FOSSACS 2007 | Regular Expressions | Software Engineering |

claim paper

Related Content

» A proof Procedure for Testing Membership in Regular Expressions

» Linear Time Membership for a Class of XML Types with Interleaving and Counting

» Adding regular expressions to graph reachability and pattern queries

» Tight Bounds on the Descriptional Complexity of Regular Expressions

» Efficient asymmetric inclusion between regular expression types

» Regexpcount a Symbolic Package for Counting Problems on Regular Expressions and Words

» An iterative algorithm for linear inverse problems with compound regularizers

» Fast BitParallel Matching for Network and Regular Expressions

» Short Regular Expressions from Finite Automata Empirical Results

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2007
Where	FOSSACS
Authors	Grigore Rosu

Comments (0)