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.