Bisimulation Relations for Fuzzy Finite Automata

Bisimulation is a well known equivalence relation for discrete event systems and hasbeen extended to probabilistic,stochastic and weighted automata.This paper introduces definitions of forward and backward bisimulation which can be applied to FFA.Some properties of them are introducedand it is shown that some commonly known compositions(union,connection,intersection) and representation theorem of fuzzy regular language for FFA are closed under bisimulation.This paper also introduces a algorithm to compute largest forward bisimulation.In theend,the difference between forward bisimulation and backward bisimulation is given.