Parallel Algorithms for Constructing Follow Automata of Regular Expressions
Bing Ren · Journal of Zhongyuan University of Technology · 2010
A parallel algorithm for translating regular expression into its follow automata is proposed in the paper.Firstly,Thompson automata of a regular expression is cousfructed.Then,the Glushkov automata is achieved by removing the path and the equivalent states which have equivalent relations merged into one.So the smaller finite automata,named follow automata is gotten.Finally the parallel processing of algorithm is described in detail with an example.