1 1 vote Can pumping lemma be used to prove that a given grammar is not regular . Theory of Computation theory-of-computation + – Abhinavg 851 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply gauravkc commented Jul 16, 2018 reply Follow flag It is a negativity test. If pumping lemma fails, you can be sure that language is not regular. But if it doesn't, the language may or may not be regular. 1 1 replyShare Abhinavg commented Jul 16, 2018 reply Follow flag Pumping lemma fails for L ----> L is not regular . ............................(1) and L has regular grammar G ----> L is regular. So, L is not regular ----> L has no regular grammar. .........................(2) From 1 and 2 we can say that , Pumping Lemma fails for L -----> L has no regular grammar. Please tell where I m wrong 0 0 replyShare Please log in or register to add a comment.
0 0 votes Pumping lemma is used for language not grammar. Pumping lemma is used for given language is not regular. abhishekmehta4u answered Jul 16, 2018 abhishekmehta4u comment Share Follow 0 reply Please log in or register to add a comment.
