Transformation of BL-general Fuzzy Automata

محورهای موضوعی : مجله بین المللی ریاضیات صنعتی

A. Saeidi Rashkolia ¹ (Department of Mathematics, Islamic Azad University, Kerman Branch, Kerman, Iran)
M. Shamsizadeh ² (Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran)

تاریخ دریافت : 1395/09/08 تاریخ پذیرش : 1397/02/28 تاریخ انتشار : 1398/05/10

کلید واژه: Quotient BL-general fuzzy automata, BL-general fuzzy automata, Strong homomorphism, Homomorphism, 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 less than the minimal quotient BL-GFA.