2 votes 2 votes Intersection of two Recursive enumerable language or two recursive language or two CSL is undecidable then how it can be said that it is closed under intersection?? Thank You mohit kumar 5 asked Aug 11, 2017 mohit kumar 5 341 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes RE ,CSL ,REC are closed under intersection.So the answer to decision problem is always "YES". Its trivial.So,it is deciadable. rahul sharma 5 answered Aug 11, 2017 selected Nov 9, 2017 by Arjun rahul sharma 5 comment Share Follow See all 4 Comments See all 4 4 Comments reply mohit kumar 5 commented Aug 14, 2017 reply Follow Share But i think Intersection of two Recursive enumerable language is undecidable. 0 votes 0 votes rahul sharma 5 commented Aug 14, 2017 reply Follow Share Why it is undecidable? Its trivial that RE are closed under intersection.So answer to decision problem is always yes.If it would have been undecideable then you will get answer as sometimes yes and sometimes no. 0 votes 0 votes mohit kumar 5 commented Nov 9, 2017 reply Follow Share http://gatecse.in/grammar-decidable-and-undecidable-problems/ it says it is undecidable 0 votes 0 votes Arjun commented Nov 9, 2017 reply Follow Share Is it given like that in that link? 0 votes 0 votes Please log in or register to add a comment.