362 views
0 votes
0 votes
intersection of two recursive lang is recursive

is this problem decidable or not?

1 Answer

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

selected by

Related questions

0 votes
0 votes
0 answers
3
Na462 asked Jan 21, 2019
713 views
0 votes
0 votes
0 answers
4
Ayush Upadhyaya asked Jan 13, 2019
403 views
From http://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf $L_{26}=\{<M>|$ M is a TM such that both L(M) and $\lnot L(M)$ are infinite $\}$I was unable to get...