State Transition Diagrams for XOR
On the left you have a DFA that accepts the language of all strings over $\{0,1\}$ in which the XOR equals 1.

On the right you have a Mealy machine in which each output is the XOR of the two recent inputs (the first output is always zero).