摘要
在格半群框架下,针对下推格值自动机模型的特点,提出其两种接受词语言的方式,并利用格半群的代数性质和自动机理论,证明了这两种方式接受词语言的等价性.
The pushdown lattice-valued automata(PDLA) based on lattice monid is introducecd. Two methods of recognizing words of PDLA according to characteristics are proposed. Furthermore, the equivalence of the two methods is proved using algebraic properties of lattice monoid and theory of automata.
出处
《西安工业大学学报》
CAS
2008年第6期601-604,共4页
Journal of Xi’an Technological University
基金
陕西师范大学青年基金资助项目
关键词
下推格值自动机
格半群
词
模糊状态转移函数
pushdown lattice-valued automata
lattice monoid
words
fuzzy transition function