Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
确定有穷⾃自动机<br />
一个NFA被称为DFA,如果<br />
没有ε之上的转换动作<br />
对于每个状态s和每个输入符号a,有且只有一条标号为a<br />
的边。<br />
可以更加高效地判断一个串能否被一个DFA接受。<br />
每个NFA都有一个等价的DFA。即它们接受同样的语<br />
言。
Hooray! Your file is uploaded and ready to be published.
Saved successfully!
Ooh no, something went wrong!
Change language