in Theory of Computation
320 views
1 vote
1 vote

how to solve this type of questions

in Theory of Computation
320 views

4 Comments

both statement seem to be incorrect!
0
0
can u  explain how plz in detail?
0
0
@nikkey
S1. A and B are two sets, A is uncountably infinite for example members of A are 0<x<1 So A is uncountably infinite.
     and set B is set of natural numbers, which is countable infinite
Intersection of A and B is empty set, as nothing is common. So, S1 is false.

S2: every language is a subset of $\sum$* but every language can't be reduced to $\sum$*.
2
2
thnx, got it :)
0
0

Please log in or register to answer this question.

Related questions