1 votes 1 votes LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL Theory of Computation theory-of-computation context-free-language context-sensitive + – Parshu gate asked Dec 10, 2017 Parshu gate 746 views answer comment Share Follow See 1 comment See all 1 1 comment reply srivivek95 commented Dec 10, 2017 reply Follow Share LA ->CFL LB ->Regular LA U LB ->CFL CFL intersection LC -> CFL As CFL is not closed under intersection, LC is regular & not CFL Option (1) is wrong 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes all options are correct except b) Lc cannot be CFL All the closure properties are 1-way. CFLs are not closed in intersection, it means that the intersection is not always a CFL, i.e., it may or may not be CFL. Shivansh Gupta answered Dec 10, 2017 Shivansh Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option 1 is wrong CFL is not closed under intersection complementation and subtraction. So Lc can be regular Ram Swaroop answered Dec 19, 2018 Ram Swaroop comment Share Follow See all 0 reply Please log in or register to add a comment.