10 search results - page 1 / 2 » Provably Shorter Regular Expressions from Deterministic Fini... |
DLT
2008
13 years 6 months ago
2008
WIA
2009
Springer
13 years 11 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic ļ¬nite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ļ...
WIA
2005
Springer
13 years 10 months ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from ļ¬nite-state automata. Although state elimination is an intuitive method for computing regul...
PAAMS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
AbstractāRegular expression matching (REM) with nondeterministic ļ¬nite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....