Question

Problem 02 Design a finite-state machine that records the results of flipping a coin a certain number of times. The state machine takes as an input flip which is zero for heads and one for tails. The states are labeled so as to indicate the numbers of heads and the nurnber of tails, NONE. H. T, HH, TT HT, HHH, etc. The order that the heads or tails was flipped does not matter, only the total numbers of heads and tails flipped matters. (A) Draw the finite-state machine recording the results of flipping a coin three times. Use a "pyra midal" arrangement of the states to allow for a neat and tidy diagram. How many flip-flops are required to implement this state machine? (B) Draw the finite-state machine recording the results of flipping a coin four times. Once again, use a "pyramidal" arrangement of the states to allow for a neat and tidy diagram.How many flip-flops are required to implement this state machine?

Answer 1

dho a Cain CeCon Can imt lastly we o phpl

Mum maliess Aniade Stole cloqpom hos lo slats as Bin s-flops Machin a arom rse. dloa lent 0 HT hp HTT RHT

a gram mplt the amach Machine