Register

RECURSIVE & R.E.

• retagged by
302 views
0 votes
0 votes
Is L(M) context free language?

Tell whether language is re or non re.
• retagged by
User Avatar

1 Answer

0 votes
0 votes
if a language is cfl then it is also recursive and recursive enumerable.

Because according to chomskey every type 2 language is subset of type1 which is subset of type 0.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

6 votes
6 votes
4 answers
1
ari asked Aug 18, 2015
3,128 views
Let A and B be disjoint, R.E. languages. Let A' U B' also be recursive enumerable. What can you say about A and B?
Let $A$ and $B$ be disjoint, R.E. languages. Let $\bar A \cup \bar B$ also be recursive enumerable. What can you say about $A$ and $B$?(a) Neither A nor B is decidable is...
User Avatar
2 votes
2 votes
1 answer
2
iarnav asked Oct 30, 2017
371 views
R.E Language Question
Let A≤mB denotes that language A is mapping reducible (also known as many-to-one reducible) to language B. then what can you say about this - True/False a) A is Recursive, but B is not R.E
Let A≤mB denotes that language A is mapping reducible (also known as many-to-one reducible) to language B.then what can you say about this - True/Falsea) A is Recursive...
User Avatar
0 votes
0 votes
1 answer
3
Xylene asked Jun 17, 2017
1,199 views
Union of R.E and non R.E
What is the class of the language resulting from Union of R.E and non R.E ? (R.E => recursively enumerable)
What is the class of the language resulting from Union of R.E and non R.E ?(R.E = recursively enumerable)
User Avatar
Link Copied!