The Gateway to Computer Science Excellence
0 votes
77 views
Intersection of Recursive and Recursively Enumerable language is____________________ ?
in Theory of Computation by Active (3.6k points) | 77 views
0
Recursive closed under intersection , and RE also closed under intersection.

So, it must be RE.
0
okay.. thanks.. 😊
0

@srestha

what if the question is like, Intersection of CFL and Recursively Enumerable language is____________________ ?

0
This type ques will not come. Can u give such example, where one is CFL and another one is RE??
0
I think the Intersection of CFL and Recursively Enumerable language is also RE, because every CFL is RE, and RE are closed under intersection. So the result must be RE.
0
yes, RE, but sometimes it can be CFL too.
0
Then too its also RE, as again all CFL are RE..
0
yes, I am not denying it.

2 Answers

0 votes
Every Recursive Language is Recursively Enumerable. Further, Recursively Enumerable Languages are closed under intersection. Therefore, the intersection of a Recursive Language and a Recursively Enumerable Language is Recursively Enumerable.
by Junior (839 points)
0 votes
It should be recursive as recursive language is a subset of REL
by (21 points)

Related questions

0 votes
1 answer
2
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,382 answers
198,529 comments
105,323 users