GATE CS 2014: Countability of Σ* (Strings) and Power Set (2Σ*) Explained

```

Computer Sciences > GATE 2014 SET-3 > Formal Languages

Let Σ be a finite non-empty alphabet and let 2Σ* be the power set of Σ*. Which one of the following statements is TRUE?

A

2Σ* is countable and Σ* is uncountable

B

2Σ* is uncountable and Σ* is countable

C

Both 2Σ* and Σ* are countable

D

Both 2Σ* and Σ* are uncountable

Correct : d

Similar Questions

Let L1 be a regular language and L2 be a context-free language. Which of the following languages is/are context-free?

#1077 MSQ

For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110. Which of the following languages is/are context-free?

#1097 MSQ

Consider the alphabet Σ = {0, 1}, the null/empty string λ and the sets of strings X0, X1, and X2 generated by the corresponding non-terminals of a...

#1183 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......