{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

automata-9

# automata-9 - Automata Chapter 9 Turing Machines Chapter 9...

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

Automata Chapter 9. Turing Machines

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

View Full Document
Chapter 9. Turing Machines There are some L: not context-free, such as {a n b n c n } and {ww}. New language families? Different type of storages? The most powerful of automata and the limits of computation? Turing machine
9.1 The Standard Turing Machine Definition 9.1 A Turing machine M is defined by M = (Q, , Γ , δ , q 0 , , F), where Q: the set of internal states, : the input alphabet, Γ : a finite set of symbols, the tape alphabet ( Γ -{ } ), δ : Q X Γ Q X Γ X {L, R} Γ is a special symbol called the blank , q 0 Q is the initial state, F Q is the set of final states. Control unit Read-write head Tape

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

View Full Document
9.1 The Standard Turing Machine Ex 9.1 δ (q 0 , a) = (q 1 , d, R) Control (q 0 ) Read-write head Tape a b c Control (q 1 ) Read-write head Tape d b c
9.1 The Standard Turing Machine Ex 9.2 the Turing machine by Q = {q 0 , q 1 }, = {a, b}, Γ = {a, b, }, F = {q}, δ (q 0 , a) = (q 0 , b, R), δ (q 0 , b) = (q 0 , b, R), δ (q 0 , ) = (q 1 , , L). Control (q 0 ) Read-write head Tape a a

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

View Full Document
9.1 The Standard Turing Machine Ex 9.3 Q, , Γ
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}