1. In reference to a Turing machine, an alphabet refers to acceptable symbols for a given turing machine.

2. The start state is the initial state of the Turing machine.

3. Select the term that this definition matches.

4. Select the term that this definition matches.

5. Select the term that this definition matches.

6. Select the term that this definition matches.

7. Objects change their state in response to ________________________.

8. It is a __________________ that captures a change to the objects state.

9. A state diagram is also referred to as a state machine or statechart

10. A state diagram shows the states of a _____________.

11. A state is represented as a _____________________.

12. When using Turing machines, state transition diagrams and their associated transition rules can be expressed as ____________.

13. This Turing machine adds two unary numbers by removing the first 1 and then moving it to the next space. It then _______________________________________.

14. The first line of the transition rules shown here (relating to the diagram above) means: if we are on state 1, and receive a 1, then write a square to the tape and __________________.

15. Read the excerpt below. The Turing machine below is in S0, with the read/write head over the square pointed to by the arrow. Which direction does the head move first?

16. How many moves would the head make before it actually writes a symbol?

17. What happens if the machine is in S1 and reads in a Ã˜?

18. Assuming numbers are coded in such a way that 1 = 0, 11 = 1, 111 = 2, 1111 = 3 etc. what is the purpose of this Turing machine?

19. A FSM can recognize only regular expressions. A stack machine can recognize context-free languages,

20. Finite automaton requires memory which is why it is possible for it to remember the next state as well as its current state.