>
Fa   |   Ar   |   En
   transformation of bl-general fuzzy automata  
   
نویسنده saeidi rashkolia a. ,shamsizadeh m.
منبع international journal of industrial mathematics - 2019 - دوره : 11 - شماره : 3 - صفحه:177 -187
چکیده    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.
کلیدواژه homomorphism; strong homomorphism; bl-general fuzzy automata; quotient bl-generalfuzzy automata; transformation of bl-general fuzzy automata
آدرس islamic azad university, kerman branch, department of mathematics, iran, graduate university of advanced technology, department of mathematics, iran
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved