retagged by
2,040 views

4 Answers

1 votes
1 votes
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?

L1 ⋂ L2 = RE

EXPRESSIVE POWER F

RE SUBSET OF RECURSIVE ENUMERABLE LANGUAGE
0 votes
0 votes
These type of checking are not done using set operations;instead of that take examples (null,sigma*) to check the property of lang...

Or

Simply if u donot want to get into complexities , when given these kind of question of intersection ...blindly answer the property of the larger set ... Here ,Rec intersects RE= RE  or reg intersect cfl= cfl
0 votes
0 votes

hope it helps...

Related questions