A formalization of multi-tape Turing machines - ScienceDirect
proof verification - Non-deterministic 2-tape Turing Machine to accept the language $L=\{x\#y \mid x,y \in \{0,1\}^\star, x \text{ is contained in } y\}$ - Mathematics Stack Exchange
Lower Bounds on the Time-complexity of Non-regular Languages on One-tape Turing Machine Miaohua Xu For Theory of Computation II Professor: Geoffrey S. - ppt download
Semi-Infinite Tape Turing Machine
CS 120, Fall 2002, Lab 12
Introduction to Computer Science and Algorithms
Turing machine - Wikipedia
A high-level depiction of a single-tape Turing Machine | Download Scientific Diagram
Section 3.1
L03_ChurchTuring
configuration of Turing machine
Turing Machine
4.6. Multi tape Turing machines, simulation
Multi Head, Multi Tape Turing Machine
Complexity & P
Multi Head, Multi Tape Turing Machine
A general introduction to Turing Machine
Multi-tape Turing Machine
Turing Machine - an overview | ScienceDirect Topics