0 votes 0 votes Prove that set of all the languages are uncountable? himgta asked Jul 23, 2018 himgta 444 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes i think question is incomplete bcoz let $\sum$=$(a,b)^{*}$ and language be set all string such that|w|=2 so string will be=aa,ab,ba ,bb .it is countable so how can we say that all language is uncountable. BASANT KUMAR answered Jul 23, 2018 BASANT KUMAR comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Let ∑={a,b} ====> ∑* = (a+b)* Every language is a collection of strings Therefore L ⊆ ∑* Collections of all languages means every subset of ∑* Therefore powerset of ∑* is the set of all languages. We know that, ∑* is countable set There are One property of countable sets says that, power set of countable set is uncountable. Shaik Masthan answered Jul 23, 2018 Shaik Masthan comment Share Follow See all 2 Comments See all 2 2 Comments reply himgta commented Jul 23, 2018 reply Follow Share I am asking about the proof of that property....can u plz provide? 0 votes 0 votes Shaik Masthan commented Jul 23, 2018 reply Follow Share I just remember that property... U can google it.. And the read the PDF. 0 votes 0 votes Please log in or register to add a comment.