Regular grammars with truth values in lattice-ordered monoid and their languages
Regular grammars with truth values in lattice-ordered monoid and their languages
复制标题
DOI：
10.1007/s00500-004-0427-y
复制
发表时间：
2006-01
期刊：
影响因子：
4.1
通讯作者：
Li Sheng;Yongming Li
中科院分区：
文献类型：
--
作者：
Li Sheng;Yongming Li
在本研究中，我们引入了格值正则文法的概念。这种文法已成为分析模糊有限自动机的必要工具。讨论了格值有限自动机（LA）与格值正则文法（LRG）之间的关系，得到了如下结果：对于给定的LRG，存在一个LA使得它们接受相同的语言，反之亦然.我们还证明了确定性格值正则文法和确定性格值有限自动机之间的等价性。
In this study, we introduce the concept of lattice-valued regular grammars. Such grammars have become a necessary tool for the analysis of fuzzy finite automata. The relationship between lattice-valued finite automata (LA) and lattice-valued regular grammars (LRG) are discussed and we get the following results, for a given LRG, there exists an LA such that they accept the same languages, and vice versa. We also show the equivalence between deterministic lattice-valued regular grammars and deterministic lattice-valued finite automata.