求解正则表达式方程组高斯消元法的矩阵方法

Computer-Oriented Gaussian Elimination for Seeking the Answer of Regular Expression Equation Set

本文在分析现有求解正则表达式方程组最小不动点的高斯消元法基础上，提出了一种利用系数矩阵进行消元变换求解正则表达式方程组的高斯消元法，并给出易编程的实现算法。

This paper,on the basis of analysing the existing gaussian elimination of seeking the minimal fixed point of regular expression equation set, proposes a sort of gaussian elimination which uses coefficient matrix to do the elimination transform for seeking the answer of regular expression equation set, as well as to give the easyprograming algorithm for implementation.