Intuitionistic fuzzy finite switchboard state machines

摘要

The notion of intuitionistic fuzzy finite switchboard state machines and (strong) homomorphisms of intuitionistic fuzzy finite state machines are introduced, and related properties are investigated. After we give a congruence relation on the set of all words of elements ofX of finite length, the quotient structure is discussed. We show that the family of equivalence classes is a finite semigroup with identity.