Please show all steps and include explanations. Thanks. 1. Mystery FSM Consider
ID: 3607276 • Letter: P
Question
Please show all steps and include explanations. Thanks.
1. Mystery FSM Consider the finite state Moore machine shown below. The input to this finite state machine (FSM) is a sequence of bits in series coming in at input M, and the output is a sequence of bits appearing at output R. 00/0 "CI 10/0 1. Assuming that the FSM starts in the "Start" state, write the sequence of bits appearing as output R if the sequence of input bits is 10000001001000011 (starting from left to right) 2. Describe in words what this FSM does. Specifically, what does the output R indicate about the input sequence?Explanation / Answer
Consider this table:
Current State
Input
Next State
Output
Start
0
A
0
Start
1
Start
0
A
0
B
0
A
1
Start
0
B
0
B
0
B
1
C
0
C
0
A
1
C
1
Start
1
1.
String: 10000001001000011
Output: 00000001001000010
2. The output of this FSM becomes high when current bit is 1 and at least two previous bits were 0s. Consider start state, if input is 1 then output is 0 and it remains in start state. When a single 0 bit comes it transitions to A with output 0. Now if 1 comes it transitions to start state again because continuous 0s are required and if 0 comes in A then it transitions to B where it remains in B until 1 comes and produces output 1 transitioning to C. In C state also if one wants to trace back to C then all the paths followed (c->start->A->B->C or C->A->B->C) will contain at least two 0s.
So this output indicates that output becomes high when at least two 0s followed by one 1 bit is provided.
Current State
Input
Next State
Output
Start
0
A
0
Start
1
Start
0
A
0
B
0
A
1
Start
0
B
0
B
0
B
1
C
0
C
0
A
1
C
1
Start
1
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.