how do you diagram the finite state machine as well as how to fill out the associate 5187904

how do you diagram the finite state machine, as well as how to fill out the associated truth table

We are designing a palindrome-finder circuit with a 1-bit input I(t) and a 1-bit output O(t), that will produce, at time t, whether the sequence {I(t-2), l(t-1), l(t)) is the same backwards and forwards (e.g, 101). Well assume I(t) has been 1 for all negative time (i.e., before the finder circuit starts). As an example, the input: will produce the output o: 110 00 01 001011 0 0 I: 11 00111000 1011 0 0 a) [15 pts] Complete the FSM diagram below. Our states have been labeled Sxy indicating that the previous 2 bits, (l(t-2), I(t-1)) would be fx, y). The previous state is encoded in (P1,PO), the next state is encoded in (N1,NO), and the output is encoded as O. Make sure to indicate the value of the output on your state transitions. S00 S10 S11 PO 0 0 P1 N1 No 0 0

We are designing a palindrome-finder circuit with a 1-bit input I(t) and a 1-bit output O(t), that will produce, at time t, whether the sequence {I(t-2), l(t-1), l(t)) is the same backwards and forwards (e.g, 101). We'll assume I(t) has been 1 for all negative time (i.e., before the finder circuit starts). As an example, the input: will produce the output o: 110 00 01 001011 0 0 I: 11 00111000 1011 0 0 a) [15 pts] Complete the FSM diagram below. Our states have been labeled Sxy indicating that the previous 2 bits, (l(t-2), I(t-1)) would be fx, y). The previous state is encoded in (P1,PO), the next state is encoded in (N1,NO), and the output is encoded as O. Make sure to indicate the value of the output on your state transitions. S00 S10 S11 PO 0 0 P1 N1 No 0 0

"Get 15% discount on your first 3 orders with us"
Use the following coupon
FIRST15

Order Now