Chapter D Finite State Machines

Question.3 Design a FSM which will accept a binary string not containing 000.Here's a starting point for you. Remember, the FSM has to signal when any string isinout which does not contain 000. If a string with 000 is presented then no furtherstrings are accepted since the 'death string' has been processed. Ouch.Question 4. States Waking Up It's morning again. Your world consists of your bed,your alarm clock and your mobile phone. Possible states are sleeping, alarm buzzing,turning off alarm, pressing snooze button, getting up.1. Draw out a state diagram graph for these states2. Label transitions between the states that have meaning for you3. Look at your state diagram. Is it possible for you to leave the house with the alarmswitched on?4. Compare and contrast your state diagram with a friend.5. Now add in the answering phone state. Can you now leave the house with the alarmon?Question 5. UCW is full of FSM's 1. Make a comprehensive list of all machines (egvending machines (eg drink dispenser)) at UCW which may be modelled using theFSM approach2. Choose one machine and produce a comprehensive FSM state diagram. Produce itdirectly if you like or by the 'reducing the tree' method used with the coke machine inclass.Question 6. Here the problem is to design an FSM which will recognize theoccurrence of "0110" in any series of input bits, sunce as0100100010110010101010110. Below you can see a student's attempt to solve theproblem. Does it work? How well does it work? Can you improve on it? Or is it aload of balls with some weird links? OK Solve the problem yourself.