MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
نویسندگان
1 Mathematics Department, Jaypee Institute of Information Technol- ogy, A-10, Sector-62, Noida-201307 (U. P.), India
2 Department of Mathematics, JSS Academy of Technical Education, C- 20/1, Sector-62, Noida-201301 (U. P), India
doi
10.22111/ijfs.2013.164چکیده
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recognized by a nite automaton with vague ( final) states is shown in this paper. Finally, an ecient algorithm is given for minimizing the nite automaton with vague ( final) states. Similarly, it can be shown for intuitionistic fuzzy regular language. These may contribute to a better understanding of the role of nite automaton with vague ( final) states or the nite automaton with intuitionistic fuzzy ( final) states while studying lexical analysis, decision making etc.
