Question 2: Finite State Machine (FSM) State Transition (1 P…
Question 2: Finite State Machine (FSM) State Transition (1 Point) You are given the following state diagram for an FSM: States: A, B, C Input: X (can be 0 or 1) Transitions: From A: If X == 0, stay in A If X == 1, go to B From B: If X == 0, go to C If X == 1, stay in B From C: If X == 0, go to A If X == 1, go to B Starting from state A, and given the input sequence 1, 1, 0, 0, 1, list the sequence of states the FSM transitions through.
Read Details