Is there anyone who can do the following finite state machine problem with fewer states?
S: initial node

A0..A3 represents the 0101 sequence

B0..B3 represents the 1100 sequence

The two digites after the state's name colon represent the output;

00 >> Z1=0, Z2=0



Drawn using graphviz