摘要
In this paper the notion of rational fuzzy language is introduced, and a theorem is obtained: a fuzzy subset of Σ* is recognizable if and only if it′s rational. The result connects the rational fuzzy language with fuzzy finite-state automaton language.
In this paper the notion of rational fuzzy language is introduced, and a theorem is obtained: a fuzzy subset of Σ* is recognizable if and only if it′s rational. The result connects the rational fuzzy language with fuzzy finite-state automaton language.
基金
This subject is supported by National Natural Sciences Foundation of China ( 6980 30 0 7) and theYouth Science and Technology Foundation of UESTC( YF0 2 0 1 0 1 )
