| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 391364 | Fuzzy Sets and Systems | 2006 | 15 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
