Question: Prove that the following DFA accepts all strings representing numbers base 10 whose digits sum to a value that is divisible by 4 and nothing
Prove that the following DFA accepts all strings representing numbers base 10 whose digits sum to a value that is divisible by 4 and nothing else. Use induction on the length of input strings.
| 0,4,8 | 1,5,9 | 3,7 | 2,6 | |
| --> *q0 | q0 | q1 | q3 | q2 |
| q1 | q1 | q2 | q0 | q3 |
| q2 | q2 | q3 | q1 | q0 |
| q3 | q3 | q0 | q2 | q1 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
