1 votes 1 votes Theory of Computation made-easy-test-series regular-language regular-expression + – Sambhrant Maurya asked Jan 9, 2019 • edited Mar 3, 2019 by Rishi yadav Sambhrant Maurya 678 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Sambhrant Maurya commented Jan 10, 2019 reply Follow Share Yes that's what I'm saying. L1= reg-CFL = reg ∩ CFL' = reg ∩ CSL = CSL ? 0 votes 0 votes Ayush Upadhyaya commented Jan 13, 2019 reply Follow Share was answer to this L2 and L3? 0 votes 0 votes Sambhrant Maurya commented Jan 13, 2019 reply Follow Share @Ayush Upadhyaya Yes 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L1----->CFL L2----->REGULAR(a*b*) L3------>REGULAR(fie) L4----->CFL(a^nb^n) abhishekmehta4u answered Mar 26, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L3=ϕ so L3 is regular and the remaining all are CFL KundaN_MCA_GATE2020 answered Jul 28, 2021 KundaN_MCA_GATE2020 comment Share Follow See all 0 reply Please log in or register to add a comment.
–1 votes –1 votes None of them are regular.Regular languages don't have memories. Avik Chowdhury answered Jun 19, 2020 Avik Chowdhury comment Share Follow See all 0 reply Please log in or register to add a comment.