申論題

7. Let L be the set of binary strings whose values are multiple of 7, (namely, L = {0, 111,1110,10101, .}). Design a finite state machine M = (Q, Σ,δ,q₀, F) to recognize the language L. Although no formal proof is required, you should explain why your machine M accepts only strings in L, and every binary string in L is accepted by M.