loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 First International Multi-Symposiums on Computer and Computational Sciences
Explicitly Parallel Regular Expressions
Hangzhou, Zhejiang, China
June 20-June 24
ISBN: 0-7695-2581-4
ASCII Text
x 
 
Brett D. Estrade, A. Louise Perkins, John M. Harris, "Explicitly Parallel Regular Expressions," Computer and Computational Sciences, International Multi-Symposiums on, vol. 1, pp. 402-409, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006.
 
 
BibTex
x
 
@article{ 10.1109/IMSCCS.2006.60,
author = {Brett D. Estrade and A. Louise Perkins and John M. Harris},
title = {Explicitly Parallel Regular Expressions},
journal ={Computer and Computational Sciences, International Multi-Symposiums on},
volume = {1},
year = {2006},
isbn = {0-7695-2581-4},
pages = {402-409},
doi = {http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.60},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Computational Sciences, International Multi-Symposiums on
TI - Explicitly Parallel Regular Expressions
SN - 0-7695-2581-4
SP402
EP409
A1 - Brett D. Estrade,
A1 - A. Louise Perkins,
A1 - John M. Harris,
PY - 2006
VL - 1
JA - Computer and Computational Sciences, International Multi-Symposiums on
ER -
 
Brett D. Estrade, Louisiana State University, USA
A. Louise Perkins, The University of Southern Mississippi, USA
John M. Harris, The University of Southern Mississippi, USA
The equivalence of non-deterministic finite automata (NFA^1), 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.
Citation:
Brett D. Estrade, A. Louise Perkins, John M. Harris, "Explicitly Parallel Regular Expressions," imsccs, vol. 1, pp.402-409, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.