recursively enumerable
常見(jiàn)例句
- 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.
從正則語(yǔ)言識(shí)別的角度証明了正則語(yǔ)言的識(shí)別系統(tǒng)確定有限自動(dòng)機(jī)所識(shí)別的語(yǔ)言集是一個(gè)遞歸可枚擧集，同時(shí)討論了正則語(yǔ)言的可遞歸性。 返回 recursively enumerable