常見例句

雙語例句

• The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved, and then, the recursiveness of regular language was analyzed.
  從正則語言識(shí)別的角度證明了正則語言的識(shí)別系統(tǒng)確定有限自動(dòng)機(jī)所識(shí)別的語言集是一個(gè)遞歸可枚舉集，同時(shí)討論了正則語言的可遞歸性。
返回 recursively enumerable