Turing Machine
2-way infinite tape, discrete symbol positions
Finite alphabet e.g., {0, 1, a, b, x, y, o}
FSM reads and writes symbols
Input: current symbol
Output: write symbol, move left or right
Blank symbol
0
1
0
0
FSM
Processing unit
Secondary storage with
infinite number of cells
Tape head
...
...
Previous slide
Next slide
Back to first slide
View graphic version