1. Finite state machines are a simple, intuitive way of capturing _______________.

2. Finite state machines are often used as a tool by programmers to _______ and formalise the operation of programs.

3. An example of a "device" that has been designed by using finite state machines is:

4. Finite machines can also be used as an ____________________________ to describe the operation of Turing machines.

5. A finite state machine is described by: (which of the following apply?)

6. A finite state machine is described by an input alphabet. This defines _____________________________

7. Finite state machines can be represented graphically using:

8. State transition diagrams consist of states and transitions.

9. Generally speaking states are represented by arrows and transitions are represented by circles.

10. A finite state machine has output but is never depicted showing the input.

11. Finite automata are often used in the frontend of programming language compilers. Such a frontend may comprise several finite state machines that implement a ____________________

12. An example of a "device" that has been designed using FSM could be a controller that opens an automatic door.

13. In this diagram, the states have been encoded using _________________________. The sensors have also been encoded using _____________.

14. Have a look at the following formula for a door controller. Which of the following statements is likely to be true (with FSM in mind)

15. Suppose you were given the example of a vending machine. What would you do first to convert this FSM to a circuit?