in Theory of Computation edited by
7,651 views
30 votes
30 votes

Let $\Sigma$ be a finite non-empty alphabet and let $2^{\Sigma^*}$ be the power set of $\Sigma^*$. Which one of the following is TRUE

  1. Both $2^{\Sigma^*}$ and $\Sigma^*$ are countable
  2. $2^{\Sigma^*}$ is countable and $\Sigma^*$ is uncountable
  3. $2^{\Sigma^*}$ is uncountable and $\Sigma^*$ is countable
  4. Both $2^{\Sigma^*}$ and $\Sigma^*$ are uncountable
in Theory of Computation edited by
7.7k views

4 Comments

@Arjun sir, I think this should be added under TOC rather than Set Theory. 

4
4

Arjun sir, I too think it should be in toc, countability.

0
0
edited by

@Mk Utkarsh

a bijective mapping or one to one correspondence to natural numbers must be there for a set to be countable.

0
0

5 Answers

–1 vote
–1 vote

Option (C) 2^ (Σ *​​​​​​​)​​​​​​​ is uncountable and Σ *is countable ,is the correct answer.

Answer:

Related questions