automaton language

基本解釋

PROLOG language is selected in order to realize the automaton representation of model in computer.
爲了在計算機中實現模型的自動機表示，選用了PROLOG語言。
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)確定有限自動機所識別的語言集是一個遞歸可枚擧集，同時討論了正則語言的可遞歸性。
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)確定模糊自動機FDA與它相應的模糊語言以及FDA與其它自動機的等價性。