A Multi-Tape Turing Machine (MTTM) is a variant of the standard Turing Machine that uses multiple tapes, each with its own read/write head, instead of a single tape.
A Multi Head Turing Machine is defined as:
M = (Q, Σ, δ, Γ, q0, B, F, k)
Where:
Q → finite set of statesΣ → input alphabetδ → transition functionΓ → tape alphabet (Σ ⊆ Γ)q0 → start stateB → blank symbolF → set of final (accepting) statesk → Number of tapes in the machineSingle tape:
Multi tape:
Result:
L = { ww | w ∈ {a,b}*}
Strings like:
aaababbbbbSteps:
General format:
q0,a,B → q1,aa,R,R
Meaning:
q0a on Tape1 and B on Tape2a on Tape1a on Tape2q1q0,aB → q0,aa,RR
q0,bB → q0,bb,RR
q0,BB → q1,BB,LL
| State | Read (T1, T2) | Write (T1, T2) | Move (T1, T2) | Next |
|---|---|---|---|---|
| q0 | (a, B) | (a, a) | (R, R) | q0 |
| q0 | (b, B) | (b, b) | (R, R) | q0 |
| q0 | (B, B) | (B, B) | (L, L) | q1 |
| Feature | Single Tape | Multi Tape |
|---|---|---|
| Heads | 1 | k |
| Read | 1 symbol | k symbols |
| Move | 1 direction | k directions |
| Speed | slower | faster |
| Power | same | same |
Multi-tape TM ≡ Single-tape TM (same power)
Used for:
Any multi-tape TM can be converted to single-tape
Write rules like:
qi, (x1, x2, ..., xk) → (qj, (y1, y2, ..., yk), (m1, m2, ..., mk))
Where:
xi : symbols readyi : symbols writtenmi in L (left), R (right), S (stay)