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
SI472 Class 37
Turing Machine
Multi-Tape Turing Machine
Introduction to Turing Machines | Michael Levet
The working tape, pointer and the state of a one-tape Turing machine | Download Scientific Diagram