The language of all words with at least 2 a's can be described by the regular expression
(ab)*a and a (ba)*
(a + b)* ab* a (a + b)*
b* ab* a (a + b)*
17) The language of all words with at least 2 a's can be described by the regular expression
Answer is:
all of these
Explanation:
Related Theory of Computation MCQ with Answers
Answer is:
has atleast two a ′s
Answer is:
both 1) not context free and 2) not context free but whose complement is CF
20) If Σ = (0, 1), L = Σ* and R = (0n 1nsuch that n > 0 ) then languages L ∪R and R respectively are
Answer is: