0 votes 0 votes closed with the note: duplicate: https://gateoverflow.in/181483/toc-cfl-closure-property-doubt Is it a viable possibility: For both L and L complement to be Context Free Language but not Regular? Why? Theory of Computation context-free-language self-doubt + – Nefarious Monkey asked Dec 15, 2017 • closed Dec 16, 2017 by joshi_nitish Nefarious Monkey 216 views comment Share Follow See 1 comment See all 1 1 comment reply Anu007 commented Dec 15, 2017 reply Follow Share yes possible take {an bm where n!= m} complement is {an bm and some other strings like bm an | where n = m } 0 votes 0 votes Please log in or register to add a comment.