{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lec09TM - Turing Machines(a seven tuple Ryan Hamoud and...

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

View Full Document Right Arrow Icon
Turing Machines (a seven tuple) - Ryan Hamoud and Jorge Ramirez (Q, ∑, Γ, ó, q 0 , q accept , q reject ) Q = the states in the TM ∑ = input alphabet (will not contain blank character) Γ = tape alphabet (will contain blank character) ó= transition function q 0 = the start state q accept = the one accept state q reject = the one reject state It is possible to not finish (the string is not in the language of the turing machine) Example --------------------------------------------------- | w1 | w2 | w3 | w4 | … | w n | --------------------------------------------------- Example --------------------------------- | 0 | 1 | 0 | 0 | 0 | 1 | --------------------------------- u | q | v string | state | string 0 1 0 q 2 0 0 1 label’s the state to the right of the label. In this case, we are in state q 2 and the next string is 0 If we try to move left off of the leftmost tape square, you simply stay there. Turing Recognizable : There exists a turing machine that can “recognize” the language (every string in the language will eventually be accepted by the turing machine. String will either be rejected or loop forever). Turing Decideable : There exists a turing machine that halts on all inputs and correctly accepts or rejects each possible input string.
Background image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}