In: Computer Science
Is P(Σ∗) countable for any finite Σ?
Proof:
The above proposition stays substantial regardless of whether we permit Σ to be countably infinite. A language over Σ is a subset of Σ∗. For instance, the language of English comprises correctly of those strings (over the Roman letter set) that has an elucidation in English. In this way, 'Sir, I'm Jhon!' is in the English language, though 'I Jhon, Sir am!' isn't in the English language. Also, +0.12.345 is anything but a numeric string (i.e., not in the language of genuine numbers). The set of all languages over Σ is exactly the power set P(Σ∗) of Σ∗.
RATE THE ANSWER IF HELPS ELSE LET ME KNOW YOUR DOUBTS. YOUR UPVOTE IS EXTREMELY IMPORTANT FOR ME. THANK YOU!!!