0 votes 0 votes If the set of all words over alphabet S is countable then Any language over S must be finite. at least one language over must be uncountable. any language over S is countable. each language over S is finite Theory of Computation countable-uncountable-set theory-of-computation + – Ravi_1511 asked Nov 8, 2016 Ravi_1511 552 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes given set of all words is countable. then a language is nothing but subset of the set which contains all words. we know subset of countable set is countable. so, option C Anusha Motamarri answered Nov 8, 2016 Anusha Motamarri comment Share Follow See all 0 reply Please log in or register to add a comment.
