A three-state finite machine has {0,1} as its input and output alphabets. Given the following input sequence and its corresponding output sequence , determine the machine
Input Sequence : 00010101
Output Sequence : 011001110
I am a beginner in Finite state machine topic, I can draw only simple FSM, but don’t have any idea about this , Any type of answer will be appreciate.