0 votes 0 votes intersection of two recursive lang is recursive is this problem decidable or not? Theory of Computation decidability theory-of-computation + – vaishali jhalani asked Dec 13, 2016 vaishali jhalani 362 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Gate Mission 1 commented Dec 13, 2016 reply Follow Share this is closure property of recursive languages so its always true and hence decidable. 0 votes 0 votes Kantikumar commented Dec 13, 2016 reply Follow Share Recursive languages are closed under Intersection. So that statement is always True which makes it decidable. 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes This is a trivial fact as it follows from closure property that intersection of two recursive language is a recursive language for sure..Hence we can say that this property is decidable.. In fact Any closure property if satisfied for a given class of language and given operation, then the problem that the resultant language after applying that particular operation is also in the same class is decidable.. Habibkhan answered Dec 13, 2016 selected Dec 13, 2016 by vaishali jhalani Habibkhan comment Share Follow See all 0 reply Please log in or register to add a comment.