4,384 views
7 votes
7 votes
Number of states in minimal finite automata that accepts all binary strings that starts with 101 and is divisible by 100.

A. 102

B. 103

C. 104

D. 105

2 Answers

2 votes
2 votes

I tried in the following way,

  • first bulid the mod 100 structure.
  • Then add the starting with '101' DFA and point it to state 5.

 

although I have not completed the MOD 100 machine !

Please verify someone !

0 votes
0 votes
divisible by 100 means it is part of mod machine .so here no of states is 100 also the machine is starting with 101 so we need 4 more state .as it tell no of states in minimal nfa .so  include dead state during start od machine so 1 more state .

100+4+1=105

(d)option

Related questions

3 votes
3 votes
1 answer
3