Strong Admissible Reduction of Hesitant L-Fuzzy Automaton

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...

Full description

Saved in:
Bibliographic Details
Published inIranian journal of fuzzy systems (Online) Vol. 21; no. 4; p. 1
Main Authors Agheli, Mohammad javad, Zahedi, Mohammad Mehdi, Shamsizadeh, Marzieh
Format Journal Article
LanguageEnglish
Published Zahedan University of Sistan and Baluchestan, Iranian Journal of Fuzzy Systems 01.07.2024
Subjects
Automation
Fuzzy sets
Language
Mathematics
Pattern recognition
Online AccessGet full text

Cover

More Information
Summary: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
ISSN:1735-0654
2676-4334
DOI:10.22111/ijfs.2024.47795.8405