Description: Regular grammars and finite state automata, regular grammars split, identification of finite state automata is determined or non-determined. Enter the master regular grammar.
To Search:
File list (Check if you may need any files):
实验二有穷状态自动机
....................\NF.cpp
....................\shiyan_er.doc
Download