Sciweavers

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

11

ICALP
2010
Springer

favoriteEmaildiscussreport

116views Programming Languages» more ICALP 2010»

Efficient Evaluation of Nondeterministic Automata Using Factorization Forests

13 years 6 months ago

Efficient Evaluation of Nondeterministic Automata Using Factorization Forests

Download www.mimuw.edu.pl

In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1

Mikolaj Bojanczyk, Pawel Parys

Real-time Traffic

Factorization Forests | ICALP 2010 | Linear Time | Programming Languages | Uses Factorization Forests |

claim paper

Related Content

» Highspeed regular expression matching engine using multicharacter NFA

» Regular Expression Matching in Reconfigurable Hardware

» ZStream a costbased query processor for adaptively detecting composite events

» Towards Expressive PublishSubscribe Systems

» Performance and Interface Buffer Size Driven Behavioral Partitioning for Embedded Systems

Post Info
More Details (n/a)

Added	13 Oct 2010
Updated	13 Oct 2010
Type	Conference
Year	2010
Where	ICALP
Authors	Mikolaj Bojanczyk, Pawel Parys

Comments (0)