摘要
文章在格半群意义下,提出基于词计算的上下文无关格值文法,证明由其生成的格值词语言关于并与连接运算封闭,及其与乔姆斯基范式文法等价.
Based on lattice monid, this paper introduces new grammar model called context-free lattice-valued grammar(CFLG) whose inputs are strings of fuzzy subsets, proves that words language generated by CFLG is closed under union and concatenation, and furthermore, proves the equivalence of CFLG with Chomsky normal form.
出处
《西南民族大学学报(自然科学版)》
CAS
2010年第1期32-34,共3页
Journal of Southwest Minzu University(Natural Science Edition)
基金
浙江海洋学院课题(21065030508)
关键词
上下文无关格值文法
格半群
词
context-free lattice-valued grammar
lattice monoid
word