说明：  k中心点 编制和调试一个程序，它将用户输入的正规式转换为以状态图和矩阵形式表示的确定有穷自动机。 1．把正规式转换为NFA 2．将NFA确定化为DFA • ＃作为正规式的终止符 • 考虑复合正规式 • 开始状态号为0
(focal point for the preparation of k and debug a program, it will the user to enter the formal conversion to a state diagram and matrix forms express the determination of DFA. 1. The formal type is converted to NFA2. Will determine the NFA into a DFA )