确定有限自动机到正则表达式转换的并行处理

Parallel Conversion of Determination Finite automata to Regular Express

有限自动机和正则表达式都是描述语言重要方法,二者的转换具有重要意义.针对确定有限自动机模型做了深入的分析,在并行环境,提出了一种确定有限自动机到正则表达式的并行转换算法,并以实例详细描述了算法并行处理过程并验证了其算法的可行性.

The determination finite automata and regular express are the important methods that describe language. The conversion between them is very significant. The determination finite automata model is deeply analyzed, and a parallel algorithm of the conversion of determination finite automata to regular express is proposed in parallel environment. The parallel processing of algorithm is described in detail and its feasibility is verified.