摘要
引入了格值自动机及其语言的概念,给出了格值自动机的状态转移函数可扩充的充分必要条件,证明了确定型格值自动机与格值自动机等价的充分必要条件,研究了格值自动机的语言关于正则运算的封闭性及其条件.所得结论表明了格值自动机及其语言的特性与取值格代数性质的紧密联系.
Latticevalued automata (LA) and their languages are introduced. The sufficient and necessary conditions for the extension of state transition function are given. The sufficient and necessary conditions for the equivalence of deterministic LA and LA are proved. Finally, the closeness of families of languages of LAs under regular operations are shown and some conditions for the closeness of families of languages of LAs under intersection and reversal operations are studied. The obtained results show the close links between the LA and the algebraic properties of lattice monoid.
出处
《陕西师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2003年第4期1-6,共6页
Journal of Shaanxi Normal University：Natural Science Edition
基金
国家自然科学基金资助项目(19901028
60174016)
数学天元青年基金资助项目(10226023)
高等学校优秀青年教师教学科研奖励计划资助项目(教人司[2002]59号)
国家重点基础研究发展计划(973计划)资助项目(2002CB312200)
