Question

Which of the following statements is/are correct?
I. The language L accepts all the strings of a's and b's where the third symbol from left end is b.
The regular expression for L is (a + b)2b(a+b)*.
II. The language L accepts all the strings of a's and b's where the number of a's in a string is
divisible by 3. The regular expression for L is (b* ab* ab* ab*)*.
III. The regular expression R=(a+b)”. The number of states required to construct the minimal
DFA for the regular expression R is n+2.
(A) I and II
(B) I and III
(C) II and III
(D) All are correct​

Answer 1

Answer:

may be (c) .........

Answer 2

Answer:

c

Explanation:

regular expression and correct regular expression