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)?b(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.​

Answer 1

Explanation:

यररलमलक्षोक्षंक्षममथधठथं

Answer 2

Answer:

Ha le lo la

Gattar ka dhakkan khola

Anda se Krrankyyyy bola

Moderators pls delete my account as I dont understand hindi and I got here by mistakely

I had to join Brainly.com