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 language 繙譯
- recursively enumerable languages 遞歸可枚擧語言
- recursively enumerable boolean algebra 遞歸可枚擧佈爾代數
- Recursively enumerable degree 遞歸可枚擧度
- Fuzzy Recursively Enumerable 模糊遞歸可枚擧語言
短語
专业释义
- 循環可枚擧的
- 還原可數的
- 遞歸可數的
- 遞歸可枚擧