in Theory of Computation retagged by
1,767 views
1 vote
1 vote
is intersection of two context sensitive decidable??

I think since they are closed under intersection, it must be decidable.

please answer
in Theory of Computation retagged by
1.8k views

4 Comments

yes here only closer property is enough to say decidable
1
1
thanx sretha :)
0
0
Can any one please explain me why is it closed under intersection

I mean i know it is
Buy why??
0
0

2 Answers

4 votes
4 votes
Best answer

Yes They are ...

selected by

2 Comments

thanx a lot
0
0
One question of 2 Marks from this Table ..Session 6
0
0
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).

Related questions