1Dept of Information Science and Engineering, Bapuji Institute of Engineering and Technology, Davangere, Karnataka -577 004, India, E-mail id: researchwork04@yahoo.com
2Department of Computer Science and Engineering, BVB College of Engineering and Technology, Hubli, Karnataka, India, E-mail id: suvarnabvb@yahoo.co.in
Natural language is perhaps the most powerful tool which humans possess for conveying information. We know natural languages in general are full of ambiguities. For example, the same word in English can have different meanings depending on the context in which it is used. Consider for example, the sentences "He can do this job" and "He came with a can". To resolve such ambiguities, fuzzy logic is a more convenient tool.
In this paper, we have introduced the concepts of fuzzy context free grammar and fuzzy regular CFG. We prove that L is a fuzzy regular language if and only if L is generated by a fuzzy regular CFG. We illustrate the constructions with examples.
fuzzy context free grammar, fuzzy automata, fuzzy regular language
