This test is run by .
Note that your final mark will not be saved in the system.
Note that your final mark will not be saved in the system.
9 - A Model of Computation MatchUp
Target Level
C
Running Total
0
0%
Attempt
1 of 3
Click on a top box, then click on its match below. Or, drag a top box and drop it onto the correct match. Match all pairs before clicking ‘Check’.
State transition diagram
Infinite
Control
Symbols
Fixed
Halting
Start
Finite
Transition
The type of tape that forms part of the Turing machine
______ state machine, with which the program can be modelled
This type of state is the last that will be encountered for a valid input
This type of state is the first that will be encountered
The ______ unit, which recognises and responds to each possible state
The rules which govern movement between states
There will be a finite alphabet of...
The rules can be represented using one of these
A Turing machine comprises a single ______ program