Let f = O = {0, 1}. Construct a state diagram for a finite state machine that

Question:

Let f = O = {0, 1}. Construct a state diagram for a finite state machine that reverses (from 0 to 1 or from 1 to 0) the symbols appearing in the 4th, in the 8th, in the 12th, .. . , positions of an input string x ∈ f +. For example, if s0 is the starting state, then w(s0, 0000) = 0001, w(s0, 000111) = 000011, and w(50, 000000111) = 000100101.