|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 First International Workshop on Database Technology and Applications
Parallel Algorithms for Constructing Fellow Automata of Regular Expressions
Wuhan, Hubei, China
April 25-April 26
ISBN: 978-0-7695-3604-0
| ASCII Text | x | ||
| Sun Yuqiang, Yang Ruimin, Gu Yuwan, You Jing, "Parallel Algorithms for Constructing Fellow Automata of Regular Expressions," Database Technology and Applications, International Workshop on, pp. 57-60, 2009 First International Workshop on Database Technology and Applications, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/DBTA.2009.41, author = {Sun Yuqiang and Yang Ruimin and Gu Yuwan and You Jing}, title = {Parallel Algorithms for Constructing Fellow Automata of Regular Expressions}, journal ={Database Technology and Applications, International Workshop on}, volume = {0}, year = {2009}, isbn = {978-0-7695-3604-0}, pages = {57-60}, doi = {http://doi.ieeecomputersociety.org/10.1109/DBTA.2009.41}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Database Technology and Applications, International Workshop on TI - Parallel Algorithms for Constructing Fellow Automata of Regular Expressions SN - 978-0-7695-3604-0 SP57 EP60 A1 - Sun Yuqiang, A1 - Yang Ruimin, A1 - Gu Yuwan, A1 - You Jing, PY - 2009 KW - NFA; state; regular expressions; parallel algorithm; Follow automatata VL - 0 JA - Database Technology and Applications, International Workshop on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DBTA.2009.41
A parallel algorithm for translating regular expression into its Follow automata is proposed in the paper. Firstly, we construct the Thompson automata of a regular expression. Then, the Glushkov automata are achieved by removing the path and the equivalent states which have equivalent relations are merged into one. So we can get a smaller finite automata, named Follow automata. Finally the parallel processing of algorithm is described in detail with an example.
Index Terms:
NFA; state; regular expressions; parallel algorithm; Follow automatata
Citation:
Sun Yuqiang, Yang Ruimin, Gu Yuwan, You Jing, "Parallel Algorithms for Constructing Fellow Automata of Regular Expressions," dbta, pp.57-60, 2009 First International Workshop on Database Technology and Applications, 2009
Usage of this product signifies your acceptance of the Terms of Use.