Explicitly Parallel Regular Expressions

9 years 10 months ago
Explicitly Parallel Regular Expressions
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented regular expressions (PRE) is used to relate parallel finite automata to the shuffle operation on regular languages. Our goal is to capitalize on the equivalence of regular expressions and augmented regular expressions to increase parallelization efficiency. We use the existing automated transformation algorithms for the various finite automata listed above, as well as one of our own, to inform a transformation from augmented regular expressions to minimized deterministic finite automata (DFAmin). We then discuss the serialization of augmented regular expressions, and present a brief summary of potential applications, related research, and future directions.
Brett D. Estrade, A. Louise Perkins, John M. Harri
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Authors Brett D. Estrade, A. Louise Perkins, John M. Harris
Comments (0)