Sciweavers

IMSCCS
2006
IEEE
13 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 r...
Brett D. Estrade, A. Louise Perkins, John M. Harri...