2 votes 2 votes Theory of Computation theory-of-computation + – vaishali jhalani asked Nov 19, 2016 vaishali jhalani 794 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply thor commented Nov 19, 2016 reply Follow Share Recursive language. $L_1'$ = recursive $L_2'$ = recursive and Recursive languages are closed under intersection. 0 votes 0 votes vaishali jhalani commented Nov 19, 2016 reply Follow Share What would be the intersection of DCFL and Recursive languages and how we will get that? 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes Like this way. Aboveallplayer answered Nov 19, 2016 selected Nov 19, 2016 by Kapil Aboveallplayer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments vaishali jhalani commented Nov 19, 2016 reply Follow Share @anirudh..So while applying union , intersection etc. on languages we will see the upper bound only? 0 votes 0 votes Prashant. commented Nov 19, 2016 reply Follow Share dont just blindly take it do it manually like regualr unoin DCFL : we can think Regular but i can prove it wrong by using REgular = phi and DCFL = anbn = union gives anbn which is DCFL. so i can always say it is DCFL but no comment about REgular. 0 votes 0 votes vaishali jhalani commented Nov 19, 2016 reply Follow Share ok..thanks@anirudh 1 votes 1 votes Please log in or register to add a comment.