CSE 555 Theory of Computation (2/28) - Organic Origami
CSE 555 Theory of Computation (2/28) - Organic Origami
CSE 555 Theory of Computation (2/28) - Organic Origami
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Turing Machine<br />
Input: a string over some given alphabet Σ.<br />
Output: Yes/No.<br />
1 Input given on a tape.<br />
2 Machine has a pointer (tape head) to a tape location.<br />
3 At each moment, TM is in a unique state.<br />
4 Before reading any input, is in start state.<br />
5 If now is in state q and tape head sees letter a, the machine<br />
(a) writes a symbol on the tape, (b) moves tape head left or<br />
right, (c) transitions to the state δ(q, a).<br />
6 <strong>Computation</strong> halts on entering accept state or reject state.
Change language