Lec10 - VARIANTS OF TURING MACHINES - 2/23/05 Notes by...

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

View Full Document Right Arrow Icon
VARIANTS OF TURING MACHINES - 2/23/05 Notes by Jordan Ganoff and Niel Stuver Multitape Turing Machines Standard Turing Machine (STM) Multitape Turing Machine (MTTM) MTTM STM Steps to convert: 1. Place dots and extra tape squares separated by # 2. Let S be an STM: a. S scans tape for all symbols at tape head positions b. S makes a second pass to update the tape 3. If S moves onto a #, make this square blank and copy each subsequent square over to the right one spot MTTMs can now be used in place of STMs for homework and further proofs. Nondeterministic Turing Machines δ: Q x Γ → P( Q x Γ x {L,R} ) k – 1 tapes input tape k tapes δ: Q x Γ k → Q x Γ k x {L,R} k input tape: a b c a a a b -- -- a b c a a b represent tape heads a b c a a b # a b -- -- # a a # a b c # Σ = { a, b, c } Γ = { a, b, c, --, a, b, c, --, # }
Background image of page 1

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

View Full DocumentRight Arrow Icon
For a string to be accepted there must exist a computation path that leads the machine into q accept . Standard Turing Machine (STM)
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

Lec10 - VARIANTS OF TURING MACHINES - 2/23/05 Notes by...

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

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