[理工] Regular Expression转换问题

楼主: qwerty147852 (小城主)   2014-06-03 18:11:05
最近在探讨这个RE .NFA .DFA一连串问题,
已知
DFA is a special case of an NFA,
and both DFA and NFA are capable of
recognizing the same languages.
要怎么从题目判断NFA&DFA差别
谁能稍微解释或者是有比较容易懂的文件可供阅读的..感谢..
/*

Links booklink

Contact Us: admin [ a t ] ucptt.com