输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成） -Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first

c语言编辑器Tuber2.0 适合做老师布置的画图程序 谢谢大家-c language editor Tuber2.0 suitable arrangement drawing program teacher thank you