a. Construct a finite-state machine that will compute x + 1 where x is the input given
Chapter 9, Problem 12(choose chapter or problem)
a. 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.
b. Write the output for x = 1101.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer