Title of article :
Strong admissible reduction of hesitant L-fuzzy automaton
Author/Authors :
Agheli Goki ، Mohammad javad Department of Mathematics - Graduate University of Advanced Technology , Zahedi ، Mohammad Mehdi Department of Mathematics - Graduate University of Advanced Technology , Shamsizadeh ، Marzieh Department of Mathematics - Behbahan Khatam Alanbia University of Technology
Abstract :
In this article, after the definitions of the reduced hesitant L-fuzzy automaton (RHLFA) and the minimal hesitant L-fuzzy automaton; we convert a hesitant L-fuzzy automaton (HLFA) to an RHLFA by reducing the number of its states such that its language is equal to the original HLFA language. Then, by defining an equivalence relation on the monoid X*,we construct an HLFA whose language is equal to the language of the transformed RHLFA, and we show that this HLFA is minimal. In conclusion, we delineate the criteria under which, the number of states in the minimal HLFA is equal to the number of states in the RHLFA
Keywords :
Hesitant set , hesitant automata , behavior , lattice
Journal title :
Iranian Journal of Fuzzy Systems (IJFS)
Journal title :
Iranian Journal of Fuzzy Systems (IJFS)
