Transition Generated Function of General Fuzzy Automata

In this paper, we present the notions of sub-general fuzzy automata, primary,transition generated, and homomorphisms for general fuzzy automata (GFA). Wedemonstrate how each GFA can be accurately represented by the sum of all of itsconstituent primaries. We prove that a transition generated is homomorphism andvice versa. Also, we prove that the primary is the maximal sub-GFA generated by asingle state. We also present some related theorems.

کلیدواژه ها:

Subject Classification [۲۰۱۰]: ۰۳D۰۵ ، ۲۰M۳۵