444 views
0 votes
0 votes
Prove that set of all the languages are uncountable?

2 Answers

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.
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.

Related questions

0 votes
0 votes
0 answers
2
aambazinga asked Jul 15, 2018
805 views
How the set of all non-decreasing functions from N to N are countable?How the set of all finite partitions of N are uncountable?
1 votes
1 votes
0 answers
3
Swami patil asked Nov 27, 2017
361 views
What is exact different between countable and uncountable, decidable and undecidability I am totally confused please explain with example