0 votes 0 votes does intersection and complement problem of CSL language follow closure property? does intersection and complement problem of CSL language are decidable? Theory of Computation decidability + – harsh yadav asked Jan 9, 2019 harsh yadav 365 views answer comment Share Follow See 1 comment See all 1 1 comment reply Purva Taranekar commented Jan 28, 2019 reply Follow Share Csl's are not closed under homomorphism and substitution. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes yes, CSL are closed under complementation and intersection. so it follow closer property. abhishekmehta4u answered Mar 26, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
