Awesome q2a theme
+2 votes
What is the intersection of recursive and recursively enumerable language?
in Theory of Computation by (17 points) | 25 views

1 Answer

+2 votes
Best answer

Recursively enumerable

Recursively enumerable languages are closed under intersection, all recursive languages are also recursively enumerable. So $$\text{R.E } \bigcap \text{ R.E} = \text{ R.E}$$

by (3.6k points)
selected by
Thanks @zxy123
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,211 questions
3,186 answers
96,181 users