Answer to Question #15497 in Quantitative Methods for Sujata Roy
If this number really is divisible by 3 then state preserves, else we move
to second state.
In second state we again analyze number of input 1, and we
move to state 1, if this number becomes divisible by 3.
Result will be
state of our DFA: if final state is 1, then input string had 3n elements 1,
else it will be state 2.
Need a fast expert's response?Submit order
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!