Congruences and homomorphisms of fuzzy automata

  • Authors:
  • Tatjana Petković

  • Affiliations:
  • Department of Information Technology, University of Turku, Lemminkäisenkatu 14 A, FIN-20520 Turku, Finland

  • Venue:
  • Fuzzy Sets and Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.20

Visualization

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.