1. Give the state table for the finite-state machine with the following state
diagram:
0,0
0,1
S1
S3
start
So
1,0
1,1
0,0
1,0
S2
S4
1,0
1,1
Find the output generated from the input string 10001
3. Construct a finite-state machine that changes one bit, keep the next
unchanged, and so on.
Example: for the input: 101100011 the output: 000110110