Title of article
Transformation of BL-general Fuzzy Automata
Author/Authors
Saeidi Rashkolia, A. Department of Mathematics - Islamic Azad University, Kerman Branch, Kerman, Iran , Shamsizadeh, M. Department of Mathematics - Graduate University of Advanced Technology, Kerman, Iran
Pages
11
From page
177
To page
187
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.
Keywords
Homomorphism , Strong homomorphism , Transformation of BL-general fuzzy automata , Quotient BL-general fuzzy automata , BL-general fuzzy automata
Journal title
Astroparticle Physics
Serial Year
2019
Record number
2438598
Link To Document