Answer (a) Both are countable.
Following sets are countable
(1) Set of all strings over Σ (2) Set of all regular languages over Σ (3) Set of all languages over Σ accepted by Turing machines
(1) Set of all strings over Σ
(2) Set of all regular languages over Σ
(3) Set of all languages over Σ accepted by Turing machines
BUT
Set of all possible languages over Σ is NOT countable
64.3k questions
77.9k answers
244k comments
80.0k users