{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

September 29

# September 29 - CSCI 2670 Introduction to Theory of...

This preview shows pages 1–7. Sign up to view the full content.

CSCI 2670 Introduction to Theory of Computing September 29, 2005

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

View Full Document
September 29, 2005 Agenda Yesterday Turing machines Today ContinueTuring Machines
September 29, 2005 Announcements Homework due Wednesday 3.2 c & e, 3.6, 3.8 b, 3.12, 3.13 I will accept homeworks until 11:00 Thursday Quiz Tuesday Turing machinedefinition, calculation, and design Tests will be returned next Tuesday Ignore comment about tutorials being cancelled

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

View Full Document
September 29, 2005 Formal definition of a TM Definition: A Turing machine is a 7-tuple (Q, Σ , Γ , δ ,q 0 ,q accept ,q reject ), where Q, Σ , and Γ are finite sets and 1. Q is the set of states, 1. Σ is the input alphabet not containing the special blank symbol ~ 2. Γ is the tape alphabet, where ~ ∈Γ and Σ⊆Γ , 3. δ : Q × Γ→ Q × Γ× {L,R} is the transition function,
September 29, 2005 Formal definition of a TM Definition: A Turing machine is a 7-tuple (Q, Σ , Γ , δ ,q 0 ,q accept ,q reject ), where Q, Σ , and Γ are finite sets and 1. q 0 Q is the start state, 2. q accept Q is the accept state, and 3. q reject Q is the reject state, where q reject q accept

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

View Full Document
September 29, 2005 Computing with a TM M receives input w = w 1 w 2 …w n ∈Σ * on leftmost n squares of tape Rest of tapeis blank (all ~ symbols) Head position begins at leftmost square of tape Computation follows rules of δ Head never moves left of leftmost square of the tape If δ says to moveL, head stays put!
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}