The Gateway to Computer Science Excellence
0 votes
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
in Theory of Computation by Active | 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!

1 Answer

0 votes
  • Please tell me if im wrong. ThanksSolution
by Active
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,217 questions
59,907 answers
201,102 comments
118,146 users