Strong Admissible Reduction of Hesitant L-Fuzzy Automaton
Publish place: Iranian Journal of Fuzzy Systems، Vol: 21، Issue: 4
Publish Year: 1403
Type: Journal paper
Language: English
View: 106
This Paper With 21 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_IJFS-21-4_001
Index date: 24 September 2024
Strong Admissible Reduction of Hesitant L-Fuzzy Automaton 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
Strong Admissible Reduction of Hesitant L-Fuzzy Automaton Keywords:
Strong Admissible Reduction of Hesitant L-Fuzzy Automaton authors
Mohammad javad Agheli
Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran
Mohammad Mehdi Zahedi
Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran
Marzieh Shamsizadeh
[Automata, Fuzzy automata] Department of Mathematics, Kerman Graduate University of Advanced Technology.
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
