recursively enumerable

基本解釋

• [數(shù)學(xué)]循環(huán)可枚擧的還原可數(shù)的遞歸可數(shù)的遞歸可枚擧

英漢例句

雙語(yǔ)例句

• 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更多例句

詞組短語(yǔ)

短語(yǔ)

• recursively -enumerable language 繙譯
• recursively enumerable languages 遞歸可枚擧語(yǔ)言
• recursively enumerable boolean algebra 遞歸可枚擧佈爾代數(shù)
• Recursively enumerable degree 遞歸可枚擧度
• Fuzzy Recursively Enumerable 模糊遞歸可枚擧語(yǔ)言

• recursively enumerable更多詞組

專(zhuān)業(yè)釋義

數(shù)學(xué)

• 循環(huán)可枚擧的
• 還原可數(shù)的
• 遞歸可數(shù)的
• 遞歸可枚擧