Automaton

Algorithm

Discrete mathematics

Surjective function

Bisimulation

Artificial intelligence

Fuzzy number

Mathematics

Computer science

Fuzzy set

Fuzzy logic

Theoretical computer science

Fuzzy Sets and Systems

For the purpose of reducing the number of states of fuzzy automata, we study approximate bisimulations of fuzzy automata under fuzzy similarity measures, which are induced by residuums of left-continuous t-norms. For a real number α∈[0,1] and a fuzzy similarity measure S, we define α-approximate bisimulation under S between two fuzzy automata and prove that the degree of similarity between them is more than or equal to α if there exists an α-approximate bisimulation between them. Furthermore, we put forward the notion of surjective functional α-approximate bisimulations between two fuzzy automata under S. Using the notion of surjective functional α-approximate bisimulations under S, the α-approximate bisimulations for a fuzzy automaton under S is defined as an equivalence relation with two additional properties. According to an α-approximate bisimulation for a fuzzy automaton, an aggregated fuzzy automaton has been constructed and the degree of similarity between them is also more than or equal to α. It is significant for us to find that there might not possess the greatest α-approximate bisimulation for a fuzzy automaton, and we provide a polynomial-time algorithm for computing all maximal α-approximate bisimulations. Finally, we provide the conditions of the existence of the greatest α-approximate bisimulation.

Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures