文件名称:youqiuzhuangtai
介绍说明－－下载内容均来自于网络，请自行研究使用
正则文法拆分，识别有穷状态自动机是确定的还是非确定的，判断是否为正则文法。
-Regular grammars and finite state automata, regular grammars split, identification of finite state automata is determined or non-determined. Enter the master regular grammar.
-Regular grammars and finite state automata, regular grammars split, identification of finite state automata is determined or non-determined. Enter the master regular grammar.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
实验二有穷状态自动机
....................\NF.cpp
....................\shiyan_er.doc
....................\NF.cpp
....................\shiyan_er.doc