Some properties of dense relatively regular languages are studied.
主要讨论了稠密相对正则语言的一些性质。
In this paper, we prove: the deterministic languages are closed under infinite quotient with the regular languages.
本文证明了确定语言对与正则集的无穷次商封闭。
To verify the correctness of the finite state real time system by timed automaton can come down to the inclusion of two timed regular languages.
用时间自动机验证一个有穷状态实时系统的正确性，可归结为判定两个时间正则语言的包含问题，亦可归结为判定两个时间正则语言的交是否为空的问题。
The concepts of (deterministic) lattice-valued regular grammars(DLRG and LRG, respectively) and (deterministic) lattice-valued regular languages are formulated.
给出了（确定）格值正则文法与（确定）格值正则语言的定义。
The study of properties ofregular sets is useful to grammar inference and syntax analyses for finite-state grammars such that regular languages can be recognized automatically.
正规集是对许多语言理论起核心作用的一类语言，研究正规集的性质有助于有限态文法的文法推断和句法分析的研究以及正规集的自动识别。
The study of properties ofregular sets is useful to grammar inference and syntax analyses for finite-state grammars such that regular languages can be recognized automatically.
正规集是对许多语言理论起核心作用的一类语言，研究正规集的性质有助于有限态文法的文法推断和句法分析的研究以及正规集的自动识别。
应用推荐