regular language的意思

regular language中文翻譯：

[計]正規語言

相似詞語短語

regular───adj.經常的；定期的；有規律的；合格的；整齊的；普通的；n.（Regular）（以）雷古拉爾（人名）；n.常客；正式隊員；中堅分子

regular price───[物價]正常價格

language───n.語言；語言文字；表達能力

canons regular───常規佳能

regular season───常規賽；季賽；n.常規賽; [體]季賽

regular supply───[貿易]正常供應

regular way───（交易所的）普通交易

regular customers───常客；老主顧

colporteur regular───普通colporteur

雙語使用場景

Every dense regular language contains an imprimitive word.───每一種密集正規語言中都含有非本原字。

in 1998: every dense regular language contains an imprimitive word.───在1998年提出的另一個猜想：稠密正規語言中含非本原字；

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.───從正則語言識別的角度證明了正則語言的識別系統確定有限自動機所識別的語言集是一個遞歸可枚舉集，同時討論了正則語言的可遞歸性。

Weknow, therefore, that this language cannot be accepted correctly by any finite state machine, and is thus not a regular language.───我們知道，因此，這種語言是不能接受的正確的任何有限狀態機，因此是不經常的語言。

If we were to go looking for pi in our regular language we might find some long accidental Pilish texts.───要是我們能在正規語言中找到π，也許真可以發現意外的長篇π文。

Computer scientists call any language that can be accepted by a finite state machine a regular language.───計算機科學家呼吁任何語言，可以接受的有限狀態機定期語言。

Zhang Mojun devotes all her life to writing poems and pays attention to using regular language and rhyme.───默君一生作詩，堅守中國舊體詩創作，不僅行文規整，而且重視用韻。

S. in 1998: every dense regular language contains an imprimitive word.───在1998年提出的另一個猜想：稠密正規語言中含非本原字；

英語使用場景

We have to be fighting for rational language, fighting for regular language, fighting for language of the rule of law to be the dominant utterance!

Zhang Mojun devotes all her life to writing poems and pays attention to using regular language and rhyme.

S. in 1998: every dense regular language contains an imprimitive word.

Language spot Regular language spots encourage the students to think about the grammatical structure of the new language.

S . in 1998: every regular language is regular component splittable.

It is a potential way to approving a language being a non timed tree regular language.

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.