格值自动机与格值正则文法  

Automata with Truth Values in Lattice Moniod and Grammars

作　　者：盛莉[1] 雷红轩[1] 

机构地区：[1]陕西师范大学数学与信息科学学院,陕西西安710062

出　　处：《汉中师范学院学报》2004年第3期25-32,共8页Journal of Hanzhong Teachers College

摘　　要：　给出了格值文法的定义与分类,对格值正则文法与自动机的关系作了详细讨论,得出了两个重要的结论,即:由给定的格值正则文法可以构造一个格值自动机使二者接受的语言集相同;反之亦然.The relationships between lattice_valued automata and grammars are disscused in this paper. And got the following results, for a given lattice_valued regular grammar, there exists a lattice_valued automation such that they accept the same language,and for a given lattice_valued automation, there is a lattice_valued regular grammar such that they accept the same language.

关 键 词：格半群 格值自动机 格值文法 格值正则文法 

分 类 号：O235[理学—运筹学与控制论]