... = (q 0 , 1) = q 1 (q 0 , 0010) = (q 1 , 0) = q 3 Formal Languages and Automata 正规语言(regular languages) 设一个DFA A = (Q, , , q 0 , F ) 定义A 的语言: L(A) = w ( q 0 , w) F 设L 是 上的语言,如果...
基于8个网页-相关网页
fuzzy regular languages fuzzy正则语言
relatively regular languages 相对正则语言
generalized regular languages 广义正则语言
l-valued regular languages 格值正则语言
lattice-valued regular languages 格值正则语言
Regular Languages & Finite Automata 正规语言与有限自动机
Namely we show that omega powers, together with boolean combinations and concatenations, are not sufficient to express the class of ω-regular languages.
实际上,我们证明了omega power算子和布尔算子以及连接算子一起无法表达整个ω-正则语言类。
参考来源 - 理论计算机科学中的若干下界结果In this thesis, we use mostly syntactic congruences and syntactic monoids to study some generalized disjunctive languages and generalized regular languages.
本文主要利用句法同余和句法幺半群对若干广义析取语言和广义正则语言进行研究。
参考来源 - 关于若干广义析取语言和广义正则语言的研究·2,447,543篇论文数据,部分数据来源于NoteExpress
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.
用时间自动机验证一个有穷状态实时系统的正确性,可归结为判定两个时间正则语言的包含问题,亦可归结为判定两个时间正则语言的交是否为空的问题。
应用推荐