GATE CSE
First time here? Checkout the FAQ!
x
0 votes
67 views

asked in Theory of Computation by Loyal (3.2k points)   | 67 views
option d ?
D. Set of all languages over a finite alphabet is countable (finitely or infinitely). Rest all options all incorrect.

1 Answer

0 votes
Best answer
Ans d is correct.

set of all integer is countable. Generate like 1, -1,2,-2... so for a number x. I will take 2x steps to generate it or the corresponding natural number will be 2x. And set of all strings is also countable .

Because (a) is incorrect due to there exist a one to one correspondence between natural no and sigma *

(b) is also incorrect because sigma* multiply as much time it remain same

(c) power set of every countable infinite set is always uncountable set

so d is correct option
answered by (361 points)  
edited by

For countable set, is one-one mapping to integers necessary?

If not, then for option (D), I can map $\sum$* to set of integers as per their lengths.



Top Users Mar 2017
  1. rude

    4272 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2254 Points

  6. 2018

    1514 Points

  7. Vignesh Sekar

    1344 Points

  8. Akriti sood

    1262 Points

  9. Bikram

    1258 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,454 questions
26,775 answers
60,982 comments
22,994 users