..

Dark Mode

2,614 views

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

(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

0 votes

2

0

edited
Feb 2, 2019
by Astitva Srivastava

@gmrishikumar Any set is countably infinite if you can make one-to-one correspondence of its elements with natural numbers.

In case of prime numbers, you can say that -:

1st prime = 2

2nd prime = 3

3rd prime = 5.............and so on.

Thus, they are countably infinite.

0

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

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