Congruences and homomorphisms of fuzzy automata

被引:44
|
作者
Petkovic, T [1 ]
机构
[1] Univ Turku, Dept Informat Technol, FIN-20520 Turku, Finland
基金
芬兰科学院;
关键词
Fuzzy automata; algebra; congruences; homomorphisms;
D O I
10.1016/j.fss.2005.06.017
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Concepts of congruences and homomorphisms of fuzzy automata are defined and Homomorphism theorem is proved. Lattices of congruences of fuzzy automata are described and an algorithm for computing the greatest congruence contained in an equivalence of a fuzzy automaton is presented. It is used for minimization procedures for both fuzzy automata with and without outputs. Connections with previously known minimization algorithms are discussed. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:444 / 458
页数:15
相关论文
共 50 条