THEORY OF COMPUTATION MCQ PART 4
(41) The set which is not countable if we have ∑ = {a, b}, is (A) Set of all languages over ∑ accepted by turing machine (B) Set of all regular languages over ∑ (C) Set of all strings over ∑ (D) Set of all languages over ∑ ANSWER: […]