deterministic language

基本解釋

If the common language runtime (CLR) function is marked as deterministic, it should not cause side-effects in the remote server.
如果公共語(yǔ)言運(yùn)行時(shí) （CLR）函數(shù)被標(biāo)記為確定的，則它應(yīng)該不會(huì)在遠(yuǎn)程服務(wù)器中導(dǎo)致副作用。
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à)性。