MINIMAL DFA

Question

Comments

All strings ending with 4 0's

Hence 5 states are required.

Answer 1

• For binary strings divisible by 2 we need to check if the last char from right is a 0.
• For binary strings divisible by 4= 2 ² ,we need to check if the last char from right is a 00.
• ... ......

• For binary strings divisible by 16= 2 ⁴, we check if the last char from right is a 0000

So, we need 5 states for counting 4 zeros on right.

Comments

Nice explanation.

---

here no dead states are possible ? if not possible why ? we have to use trail and error here?

---

this is wrong we get 6 states by your logic guess try to draw dfa i am getting 6 by your logic