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
- Only R
- Only R and S
- All are incorrect except P
- None of the above