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.

• Type: Conference
• Year: 2006
• Where: IMSCCS
• Authors: Brett D. Estrade, A. Louise Perkins, John M. Harris
• Keywords: Augmented Regular Expressions, IMSCCS 2006, Regular Expressions, finite Automata