The set which is not countable if we have ∑ = {a, b}, is

Related MCQs

• Given S = {a, b}, which one of the following sets is not countable?
• A language is represented by a regular expression (a)*(a + ba). Which of the following strings does not belong to the regular set represented by the above expression?
• If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?
• Let L={w (0 + 1)* w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?
• The regular expression 0*(10)* denotes the same set as
• Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?
• Regular expression (x/y)(x/y) denotes the set
• The set strings of 0's and 1's with atmost one pair consecutive one's-
• The set that can be recognized by a deterministic finite state automaton is
• Which of the following pairs have DIFFERENT expressive power?