This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Click to edit Master subtitle style 7/15/11 Turing Machines Mahadevan Vasudevan COT 6410 7/15/11 Introduction In one move the TM (depending on the symbol scanned by the tape head) 1. Changes state 2. Prints symbol on the tape cell 7/15/11 M = (Q, , , , q0, B, F) Q Finite set of states Finite set of allowable tape symbols B blank, a symbol of set of input symbols, (subset of ) next move function q0  start state F Q set of final states TM Formal Definition 7/15/11 1. Start in state q0 2. Read symbol under head 3. Write new symbol 4. Shift left/right 5. Enter new state qj &#2; R  move right over any scanned symbol Computation Steps Februray 24, 2008 UCF EECS 55 Useful Composite Machines R  move right to next 0 (not including current square) ? 1110 ?1110 L  move left to next 0 (not including current square) 0111? W 0 111? R  move right to next 00 (not including current square)...
View
Full
Document
 Fall '10
 Dutton

Click to edit the document details