TuringMachine - Click to edit Master subtitle style Turing...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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  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) …? 11…10… …?11…10 … L -- move left to next 0 (not including current square) …011…1? … W …0 11…1?… R -- move right to next 00 (not including current square)...
View Full Document

This note was uploaded on 07/14/2011 for the course COT 4610 taught by Professor Dutton during the Fall '10 term at University of Central Florida.

Page1 / 14

TuringMachine - Click to edit Master subtitle style Turing...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online