1. A finite state machine is a form of abstraction because it models the behaviour of a system by showing states and transitions.

2. An example of a FSM: Consider a lift (elevator). What are the possible states of the system?

3. Representing a system as a finite state machine is very powerful because the model allows us to ________________________________.

4. Applications of finite state machines are found in many sciences. Mainly engineering, biology and most commonly in linguistics, where they are used to describe languages.

5. Read the excerpt below and in relation to the diagram, fill in the blanks.

6. A Mealy machine does not output values where as a finite state automaton does output values.

7. The following diagram represents a finite state machine which takes as input a binary number from the least significant bit. Which of the following is true?

8. Finite state automatons are unique in that they have stable and definite outputs.

9. For example, the finite state machine in the diagram has three states. If the machine is in state 1 then an A moves it to state 2 and a ___________________.

10. A _____________________ is a method of graphically representing finite-state machine.

11. Many FSMs have a final state known as the ___________________. This is indicated by a double circle.

12. The sequence baaaba would produce 100010 as the output. The sequence ababb would produce _______as the output.

13. Many communications protocols, such as USB can be defined by a finite state machine’s diagram showing what happens as different pieces of information are input.

14. You can build a finite state machine that can recognize palindromes and as it can count infinitely, it would be able to recognize all palindromes.

15. A finite state machine can not only count but count for an infinite number (e.g. never stop)