基本解釋[電子、通信與自動(dòng)控制技術(shù)]自動(dòng)機(jī)語(yǔ)言[計(jì)算機(jī)科學(xué)技術(shù)]自動(dòng)機(jī)語(yǔ)言英漢例句雙語(yǔ)例句PROLOG language is selected in order to realize the automaton representation of model in computer.為了在計(jì)算機(jī)中實(shí)現(xiàn)模型的自動(dòng)機(jī)表示,選用了PROLOG語(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ǔ)言的可遞歸性。In this paper, it is mainly discussed a finite-state deterministic fuzzy automaton(FDA), which is not only equivalent to corresponding fuzzy language and is also equally powerful as other automata.作者討論了有限態(tài)確定模糊自動(dòng)機(jī)FDA與它相應(yīng)的模糊語(yǔ)言以及FDA與其它自動(dòng)機(jī)的等價(jià)性。automaton language更多例句詞組短語(yǔ)短語(yǔ)recognized by automaton language 自動(dòng)機(jī)語(yǔ)言識(shí)別formal language and automaton 形式語(yǔ)言與自動(dòng)機(jī)automaton language更多詞組專業(yè)釋義電子、通信與自動(dòng)控制技術(shù)自動(dòng)機(jī)語(yǔ)言計(jì)算機(jī)科學(xué)技術(shù)自動(dòng)機(jī)語(yǔ)言