Question: a. Construct a finite-state machine that complements each bit of the binary input string (read left to right).
b. Write the output for the input sequence 01011.
c. Construct a finite-state machine that will compute x + 1 where x is the input given in binary form, least significant digit first (in this case, read the input right to left). You could use the binary adder of Figure 9.5 by writing 1 as 00...01 with the correct number of leading 0s, but that's much too complicated.
d. Write the output for x = 1101.