General Fuzzy Automata, New Efficient Acceptors for Fuzzy Languages

Defining a membership value (mv) for the strings of a fuzzy grammar/language and the calculation of this mv have been important issues since the inception of fuzzy automata and fuzzy languages. Some researchers have tried to calculate the mv of strings, by developing deterministic (Moore) automata which are equivalent to fuzzy automata (fuzzy languages) in terms of the accepted language. This approach is usually time demanding and becomes impractical for large fuzzy grammars and languages. In this paper, we will show how the newly developed paradigm of general fuzzy automata (GFA) solves this problem very elegantly and directly, by removing the burden of generating deterministic acceptors to calculate the mv's of the strings belonging to a fuzzy language.