The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
129 views

asked in Theory of Computation by Boss (5.1k points)
retagged by | 129 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 Active (1.7k 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.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,065 questions
36,871 answers
91,629 comments
34,760 users