recategorized
3,233 views
2 votes
2 votes
Which of the following statements is/are not correct?
(P) The class of all Turing Machines is countably infinite
(Q) The class of all DCFL's is countably infinite
(R) The class of all formal languages is uncountably infinite
(S) The set of all primes is countably infinite

  1. Only R
  2. Only R and S
  3. All are incorrect except P
  4. None of the above
recategorized

2 Answers

0 votes
0 votes

All statements are correct.

D is the answer.

edited by
0 votes
0 votes
non recursively enumerable languages doesn't fall under formal language...

http://zasoby.open.agh.edu.pl/~11sustrojny/en/chomsky-classification/index.html

Chomsky created 4 classes we should obey Chomsky i guess

so class of all formal languages is countably infinite only..

and i didn't find anywhere its written as non r.e. is formal language... everywhere its 4 class upto r.e. only
Answer:

Related questions