Transformation of BL-general Fuzzy Automata

Subject Areas : International Journal of Industrial Mathematics

A. Saeidi Rashkolia ¹ , M. Shamsizadeh ²

1 - Department of Mathematics, Islamic Azad University, Kerman Branch, Kerman, Iran
2 - Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran

Received: 2016-11-28 Accepted : 2018-05-18 Published : 2019-08-01

Keywords: Quotient BL-general fuzzy automata, BL-general fuzzy automata, Strong homomorphism, Homomorphism, Transformation of BL-general fuzzy automata,

Abstract :

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.