1 votes 1 votes is intersection of two context sensitive decidable?? I think since they are closed under intersection, it must be decidable. please answer Theory of Computation decidability theory-of-computation turing-machine recursive-and-recursively-enumerable-languages + – sushmita asked Feb 10, 2017 • retagged Jul 4, 2017 by Arjun sushmita 1.8k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments srestha commented Feb 10, 2017 reply Follow Share yes here only closer property is enough to say decidable 1 votes 1 votes sushmita commented Feb 10, 2017 reply Follow Share thanx sretha :) 0 votes 0 votes bhargav9873 commented Feb 12, 2017 reply Follow Share Can any one please explain me why is it closed under intersection I mean i know it is Buy why?? 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes Yes They are ... Anup patel answered Feb 10, 2017 • selected Feb 10, 2017 by sushmita Anup patel comment Share Follow See all 2 Comments See all 2 2 Comments reply sushmita commented Feb 10, 2017 reply Follow Share thanx a lot 0 votes 0 votes Anup patel commented Feb 11, 2017 reply Follow Share One question of 2 Marks from this Table ..Session 6 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes When we say that some Language 'X' is close under some function 'f' then here we basically mean that there exists an Algorithm to prove it. Eventually when Algo exists then it would become REC(Decidable). Rupendra Choudhary answered May 22, 2017 Rupendra Choudhary comment Share Follow See all 0 reply Please log in or register to add a comment.
