BL-general fuzzy automata and minimal realization: Based on the associated categories
نویسندگان
چکیده مقاله:
The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along with a functorial relationship between them, are introduced.
منابع مشابه
Reduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کاملMINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA
In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...
متن کاملBisimulation for BL-general fuzzy automata
In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...
متن کاملTransformation of BL-general Fuzzy Automata
In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...
متن کاملI-homomorphism for BL-I-General L-fuzzy Automata
Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...
متن کاملminimal and statewise minimal intuitionistic general l-fuzzy automata
in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove that the minimal intuitionistic general l-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 17 شماره 1
صفحات 155- 169
تاریخ انتشار 2020-02-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023