0 votes 0 votes Can someone explain this problem? Theory of Computation made-easy-test-series regular-language theory-of-computation + – Kalpataru Bose asked Sep 5, 2018 edited Mar 7, 2019 by Aditi Singh Kalpataru Bose 422 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shaik Masthan commented Sep 5, 2018 reply Follow Share Note that L and R are strictly CFL ===> doesn't have RE L ∪ R = R ====> doesn't have RE L ∩ R = L =====> doesn't have RE ∴ Both 1 and 2 2 votes 2 votes raahul commented Sep 5, 2018 reply Follow Share Both L and R are DCFL . DCFL language is not closed under union and intersection. So,both can't be regular language. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes both are cfl but not regular. abhishekmehta4u answered Mar 7, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.