[理工] 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