0 votes 0 votes Algorithms regular-language theory-of-computation + – Parshu gate asked Nov 20, 2017 Parshu gate 1.3k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply joshi_nitish commented Nov 20, 2017 reply Follow Share the set of all languages is uncountable, you can proof this using diagonalization method. rest all are countable. 1 votes 1 votes Parshu gate commented Nov 20, 2017 reply Follow Share What does countable infinite mean? If they are countable then how can they be infinite? 0 votes 0 votes joshi_nitish commented Nov 20, 2017 reply Follow Share a set is called countably infinite, if we can have one-one correspondence b/w element of a set and a natural numbers. 1 votes 1 votes abhishek tiwary commented Nov 20, 2017 i edited by abhishek tiwary Nov 20, 2017 reply Follow Share always use cantor's theorem for this type of question 2 votes 2 votes abhinowKatore commented Dec 24, 2022 reply Follow Share What's the difference between class ans set. Is set of all DCFL is countable? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 1.set of all formal language mean 2$^{\sum ^{\bigstar }}$ which is Ucountable infinite set. 2.all other are countable set using one to one correspondence to natural number so countable infinite. ans: A if u not understand then use CHATGPT amit166 answered Jan 28, 2023 amit166 comment Share Follow See all 0 reply Please log in or register to add a comment.