Journal of Frontiers of Computer Science and Technology ›› 2009, Vol. 3 ›› Issue (4): 441-446.DOI: 10.3778/j.issn.1673-9418.2009.04.011

• 学术研究 • Previous Articles    

Minimization of Mizumoto Lattice Finite Automata

WANG Yang+, YANG Qiong   

  1. College of Mathematics and Software Science, Sichuan Normal University, Chengdu 610066, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-07-15 Published:2009-07-15
  • Contact: WANG Yang


汪 洋+,杨 琼   

  1. 四川师范大学 数学与软件科学学院,成都 610066
  • 通讯作者: 汪 洋

Abstract: The notion of Mizumoto lattice finite automata took value in lattice-ordered monoids is advanced, generalized Mizumoto lattice finite automata based on lattice fuzzy strings are obtained. And its properties are discussed for details. Meanwhile, the equivalence between generalized Mizumoto lattice finite automata and its canonical one is established, based on which, its minimization algorithm is given at last.

Key words: lattice fuzzy strings, Mizumoto lattice finite automata, minimization

摘要: 提出取值为格半群的Mizumoto格值有限自动机的概念,得到基于模糊字符串的Mizumoto格值有限自动机的扩张模型,并详细讨论了其性质。同时建立了扩张Mizumoto格值有限自动机与标准扩张Mizumoto格值有限自动机的等价性,在此基础上给出了其最小化算法。

关键词: 格值模糊字符串, Mizumoto格值有限自动机, 最小化