this is closure property of recursive languages so its always true and hence decidable.

0 votes

2 votes

Best answer

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..