Uniform and Semi-uniform Topology on General Fuzzy Automata

In this paper, we define the concepts of compatibility between two fuzzy subsets on Q the set of states of a max- min general fuzzy automaton and transitivity in a max-min general fuzzy automaton. By using these notions, we construct a uniform structure on Q, and also introduce a topology on it. Then we define the concept of semi-uniform structure on a nonempty set X and by using this notion, we construct a semi-uniform structure on Q the set of states of a general fuzzy automaton. Also, we construct a semi-uniform structure on the set of all finite words on the set of input symbols of a general fuzzy automaton. Moreover by using these semi-uniform structures, we construct two topologies on Q and and obtain some properties of these topologies.