0 0 votes 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 Theory of Computation number-of-states + – himgta 336 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Anand. commented Jul 30, 2018 reply Follow flag it should be $c$ i.e $10$ 0 0 replyShare himgta commented Jul 30, 2018 reply Follow flag 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! 0 0 replyShare Please log in or register to add a comment.
0 0 votes Please tell me if im wrong. Thanks Vikas Verma answered Jul 30, 2018 Vikas Verma comment Share Follow 0 reply Please log in or register to add a comment.
