摘要
在格半群意义下,提出基于词计算的下推格值自动机模型,它的输入是输入字母表的模糊子集,即词串,对应的是具有模糊性的自然语言.并研究下推格值自动机识别的格值词语言,利用格半群的性质证明了下推格值自动机基于词的计算可以通过基于值的计算实现.
Based on lattice monid, a new type of computational models called Pushdown Lattice-valued Automata is introduced whose inputs are strings of fuzzy subsets of the input alphabet and that corresponds with nature language. Furthermore, computing with words can be implemented by computing with values by using the properties of lattice monid.
出处
《西南民族大学学报（自然科学版）》
CAS
2006年第3期581-585,共5页
Journal of Southwest Minzu University(Natural Science Edition)
关键词
下推格值自动机
格半群
词
pushdown lattice-valued automata
lattice monid
word
