State is Amiguously defined if we have more than one transitions for a given string from a given state
now make a table and for x=0,y=0,z=0 and try transitions from state A,B,C
Then for x=0,y=0,z=1 try the same thing...
then for x=0 y=1 z=0 try the same thing...
till x=1,y=1,z=1
at x=1 y=1 z=1 you will see C has two transitions A and B
Thus C is defined unambiguous
rest for all states transitions for all strings applied on states will be maximum 1