Algebraic properties of intuitionistic $$L-$$fuzzy multiset finite automata

Abstract

Algrbraic properties and structures of intuitionistic L−fuzzy multiset finite automata (ILFMA) are discussed through congruences on a semigroup in this paper. Firstly, we put forward the notion of the intuitionistic L−fuzzy compatible relation, the compatible monoid associated to the intuitionistic L−fuzzy compatible relation can be effectively constructed, and we construct two finite monoids through two different congruence relations on a given ILFMA, then we also prove that they are isomorphic. Furthermore, using the quotient structure of ILFMA, algebraic properties of intuitionistic L−fuzzy multiset transformation semigroup are discussed. According to intuitionistic L−admissible relation and homomorphism of ILFMA, we show that there is a bijective correspondence between an ILFMA and the quotient structure of another ILFMA.

Fault Diagnosis in Regenerative Braking System of Hybrid Electric Vehicles by Using Semigroup of Finite-State Deterministic Fully Intuitionistic Fuzzy Automata

“…ere are a number of practical generalizations of fuzzy sets [9,[61][62][63][64][65][66][67][68], and inference rules for these generalizations can be developed using the same techniques.…”

“…Fuzzy automata are used to handle system uncertainties more accurately, whereas classical automata fail to cater to the circumstances. Fuzzy automata have been frequently employed since the introduction of fuzzy technology and neural networks [3][4][5][6][7][8][9][10][11][12][13]. Furthermore, there were a variety of problems to be resolved, for example, medical diagnosis, car anti-crash radar, freeway management, urban road traffic control, and obstacle recognition in front of a vehicle, which required flexible, quick, and accurate decisions, and then, fuzzy neural network automata (FNNA) [14][15][16][17] are an excellent choice.…”