摘要
提出格值Mealy自动机的概念,从代数角度出发详细研究此类自动机的性质,同时研究此类自动机的同余和同态,揭示此类自动机的代数性质和取值格半群的紧密联系,最终研究格值Mealy自动机的极小化,给出可在有限步实现极小化的算法。
The notion lattice-valued Mealy-type machine is introduced, we traverse some algebraic properties of this machine and investigate the congruences and homomorphisms of this type machine. Our main results indicate that the algebraic properties of lattice-valued Mealy-type machines has close linksto the algebraic properties of lattice-ordered monoids which machines take value in. Finally we study the minimization of lattice-valued Mealy-type machines and provide an algorithm to achieve the minimal lattice-valued Mealy-type machines within finite steps.
出处
《模糊系统与数学》
CSCD
北大核心
2007年第2期53-64,共12页
Fuzzy Systems and Mathematics
基金
国家自然科学基金资助项目(10571112)
关键词
格半群
格值Mealy自动机
同余
同态
极小化
Lattice-ordered Monoid
Lattice-valued Mealy-type Machine
Congruences
Homomor-phisms
Minimization
