摘要
给出了当格半群满足交换律时,任何格值上下文无关文法都与格值Greibach范式文法等价,并利用Zadeh扩张原理,研究了格值Greibach范式文法对基于词的计算,最后得出文法对基于词的计算最终由对基于值的计算来实现。
The lattice-valued context-free grammar is equivalent to the lattice-valued Greibach grammar when the lattice semigroups satisfy the commutative laws. According to Zadeh＇s extension principle, computing with words via lattice-valued context-free grammar is studied. Finally, this principle indicates that computing with words can be implemented with values with the price of a big amount of extra computations.
出处
《重庆交通大学学报（自然科学版）》
CAS
北大核心
2009年第4期804-806,共3页
Journal of Chongqing Jiaotong University(Natural Science)
基金
安徽省高等学校青年教师科研资助计划项目(2004jq183)
关键词
格半群
基于词的计算
上下文无关文法
lattice semigroups
computing with words
context-free grammar
