52 views
What is the number of states in the minimal finite automata that accepts all the strings of a’s and b’s where each string starts with ‘bba’ and the length of the string is congruent to 2(mod 6).
(a) 8 (b) 9
(c) 10 (d) 11
| 52 views
0
it should be $c$ i.e $10$
0
It will be better if you provide explanation with your answer for understanding as who is posting the question  needs  explanation and approach as well!

• Please tell me if im wrong. Thanks
by Active