edited by
16,673 views
27 votes
27 votes

Recursive languages are:

  1. A proper superset of context free languages.
  2. Always recognizable by pushdown automata.
  3. Also called type $0$ languages.
  4. Recognizable by Turing machines.
edited by

2 Answers

Best answer
25 votes
25 votes
  1. A proper superset of context free languages. TRUE Since there are languages which are not CFL still Recursive
  2. Always recognizable by pushdown automata. FALSE
  3. Also called type $0$ languages. FALSE Recursively Enumerable languages are actually type-$0$ languages.
  4. Recognizable by Turing machines TRUE 
edited by
0 votes
0 votes

A. All CFLs are Recursive Hence Not a Proper Superset.

B. Push Down Automata Cannot Recognize Recursive Languages.

Option C is Right 

Recursive Language is a Proper subset of Recursively Enumerable Languages.

Hence Recursive Languages are also called as Type 0.

D. Recursive Languages are Recognizable by Turing Machine ( By Halting Turing Machine.)

So Answer is: C & D

Answer:

Related questions

20 votes
20 votes
3 answers
1
makhdoom ghaya asked Nov 22, 2016
9,024 views
Let $R_{1}$ and $R_{2}$ be regular sets defined over the alphabet $\Sigma$ Then:$R_{1} \cap R_{2}$ is not regular.$R_{1} \cup R_{2}$ is regular.$\Sigma^{*}-R_{1}$ is regu...
46 votes
46 votes
2 answers
2
makhdoom ghaya asked Nov 22, 2016
12,494 views
It is undecidable whether:An arbitrary Turing machine halts after $100$ steps.A Turing machine prints a specific letter.A Turing machine computes the products of two numb...
29 votes
29 votes
6 answers
4
makhdoom ghaya asked Nov 22, 2016
9,204 views
Indicate which of the following well-formed formulae are valid:$\left(P\Rightarrow Q\right) {\wedge} \left(Q \Rightarrow R\right) \Rightarrow \left(P \Rightarrow R\right)...