1 / 10

CFG => PDA

CFG => PDA. Sipser 2 (pages 99 - 118). Formally…. A pushdown automaton is a sextuple M = (Q, Σ , Γ , δ , q 0 , F) , where Q is a finite set of states Σ is a finite alphabet (the input symbols) Γ is a finite alphabet (the stack symbols) δ : (Q × Σ ε × Γ ε ) → P(Q × Γ ε )

kermit
Télécharger la présentation

CFG => PDA

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CFG => PDA Sipser 2 (pages 99-118)

  2. Formally… • A pushdown automaton is a sextuple M = (Q, Σ, Γ, δ, q0, F), where • Q is a finite set of states • Σ is a finite alphabet (the input symbols) • Γ is a finite alphabet (the stack symbols) • δ: (Q × Σε ×Γε) → P(Q × Γε) is the transition function • q0∈Q is the initial state, and • F⊆Q is the set of accept states

  3. Balanced brackets • Let M = (Q, Σ, Γ, δ, q0, F), where • Q = {q1, q2, q3} • Σ = {[, ]} • Γ = {[, $} • q0 = q1 • F = {q1, q3} • δ is given by the transition diagram:

  4. Finite automata and Pushdown automata ? Pushdown languages Regular languages

  5. Regular => Pushdown • Proposition: Every finite automaton can be viewed as a pushdown automaton that never operates on its stack. • Proof: Let M = (Q, Σ, δ, q0, F) be a finite automaton. Define M' = (Q, Σ, Γ, δ', q0, F), where…

  6. Finite automata and Pushdown automata ? Pushdown languages Regular languages

  7. Pushdown automata are nondeterministic • Build a machine to recognize PAL = {wwR| w∈{0, 1}*} 0 1 0 1 1 0 1 0 1 reading head 0 stack or pushdown store 1 Finite control 0 $

  8. Recognizing context-free languages • Lemma 2.21: If a language is context-free, then some pushdown automaton recognizes it. • Proof:

  9. Shorthand for…

  10. For example… • Let’s use this construction on: • G = (V, Σ, R, S), where V = {S} Σ = {[, ]} R = { S →Gε, S →G SS, S →G [S]}

More Related