Intuitionistic Fuzzy Multiset Finite Automata: An Algebraic-Based Study
محورهای موضوعی : مجله بین المللی ریاضیات صنعتی
M. Shamsizadeh
1
,
Khadijeh Abolpour
2
1 - Department of Mathematics, Behbahan Khatam Alanbia University of Technology, Behbahan, Iran.
2 - Department of Mathematics, Shiraz Branch, Islamic Azad University, Shiraz, Iran
کلید واژه: Automtata, Multiset, Intuitionistic&lrm, , &lrm, Intuitionistic automata&rlm, , Behavior,
چکیده مقاله :
The current study aims to introduce the notions of intuitionistic fuzzy multiset finite automata (IFMFA) concerning a given IFMFA M with states Q. For a subset T of Q, we present the notion of intuitionistic fuzzy multiset submachine generated by T. Furthermore, the behavior of IFMFA is studied and explicated by using algebraic techniques. Further, it is shown that the union and the intersection of a family of an IFMFSA are IFMFSA, as well. Subsequently, it is proved that if IFMFA M has a basis, then the cardinality of the basis is unique. Moreover, the language of IFMFA is examined and some theorems are suggested.
The current study aims to introduce the notions of intuitionistic fuzzy multiset finite automata (IFMFA) concerning a given IFMFA M with states Q. For a subset T of Q, we present the notion of intuitionistic fuzzy multiset submachine generated by T. Furthermore, the behavior of IFMFA is studied and explicated by using algebraic techniques. Further, it is shown that the union and the intersection of a family of an IFMFSA are IFMFSA, as well. Subsequently, it is proved that if IFMFA M has a basis, then the cardinality of the basis is unique. Moreover, the language of IFMFA is examined and some theorems are suggested.
