0 votes 0 votes Theory of Computation theory-of-computation + – thor asked Nov 19, 2016 thor 356 views answer comment Share Follow See 1 comment See all 1 1 comment reply ManojK commented Nov 19, 2016 reply Follow Share L may be CFL but not necessarily a regular language. 1 votes 1 votes Please log in or register to add a comment.
3 votes 3 votes If pumping lemma not setisfy for regular ,means Language is not Regular . Since pumping lemma satisfy for CFL , we cant comment it is CFL or not so we can only say Language is not regular but may be CFL nut not always CFL., Prashant. answered Nov 19, 2016 Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.