1 1 vote Theory of Computation + – ankit 3.1k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments ankit commented Nov 13, 2016 reply Follow flag Sir , I know all the closure properties of Regular , CSL , Rec and RE but for DCFL and CFL , I forget some properties many times.. but no problem but I will remember it :) ... I was just asking to know how people remember it easily.. 0 0 replyShare Arjun commented Nov 13, 2016 reply Follow flag Well I do not remember it easily- rather I only remember the easy ones :) Only a few GATE questions can be solved using closure properties. I know that complement of CFL may not always be CFL - this is not because I studied the closure property but because I have seen many examles like that. 0 0 replyShare ankit commented Nov 13, 2016 reply Follow flag Yes sir , It is correct by doing more and more examples , properties will be remembered automatically... Thanks sir for your response.. :) 1 1 replyShare Please log in or register to add a comment.
0 0 votes It will be easy to remember only the not closed once. If you consider only Reg CFL Recursive Recursive enumerable and all basic property then only cfl not closed under intersection and complementation and RE is not closed under complementation. Ankush Mitra answered Oct 28, 2018 Ankush Mitra comment Share Follow 0 reply Please log in or register to add a comment.