recursively enumerable
常见例句
- 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.
從正則語言識別的角度証明了正則語言的識別系統確定有限自動機所識別的語言集是一個遞歸可枚擧集，同時討論了正則語言的可遞歸性。 返回 recursively enumerable