recursively enumerable
基本解釋
- [數(shù)學]循環(huán)可枚舉的還原可數(shù)的遞歸可數(shù)的遞歸可枚舉
英漢例句
- 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.
從正則語言識別的角度證明了正則語言的識別系統(tǒng)確定有限自動機所識別的語言集是一個遞歸可枚舉集,同時討論了正則語言的可遞歸性。
雙語例句
詞組短語
- recursively -enumerable language 翻譯
- recursively enumerable languages 遞歸可枚舉語言
- recursively enumerable boolean algebra 遞歸可枚舉布爾代數(shù)
- Recursively enumerable degree 遞歸可枚舉度
- Fuzzy Recursively Enumerable 模糊遞歸可枚舉語言
短語
專業(yè)釋義
- 循環(huán)可枚舉的
- 還原可數(shù)的
- 遞歸可數(shù)的
- 遞歸可枚舉