Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 49 views

    Equivalence of PDAs and CFGs (Proof)

    Uploaded by

    Nehal Gupta
    This document shows that pushdown automata (PDAs) and context-free grammars (CFGs) are equivalent in expressive power by proving two things: 1) Given any CFG, a PDA can be constructed that accepts the same language generated by the CFG. 2) Given any PDA, a CFG can be generated that produces the same language accepted by the PDA. It first proves part 1 by constructing a PDA from a given CFG in Greibach normal form that simulates the leftmost derivations of the CFG. A lemma is also proved to show the languages generated are equivalent.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Equivalence of PDAs and CFGs (Proof)

    Uploaded by

    Nehal Gupta
    49 views3 pages
    This document shows that pushdown automata (PDAs) and context-free grammars (CFGs) are equivalent in expressive power by proving two things: 1) Given any CFG, a PDA can be constructed that accepts the same language generated by the CFG. 2) Given any PDA, a CFG can be generated that produces the same language accepted by the PDA. It first proves part 1 by constructing a PDA from a given CFG in Greibach normal form that simulates the leftmost derivations of the CFG. A lemma is also proved to show the languages generated are equivalent.

    Original Title

    Equivalence of PDAs and CFGs(proof).docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document shows that pushdown automata (PDAs) and context-free grammars (CFGs) are equivalent in expressive power by proving two things: 1) Given any CFG, a PDA can be constructed that accepts the same language generated by the CFG. 2) Given any PDA, a CFG can be generated that produces the same language accepted by the PDA. It first proves part 1 by constructing a PDA from a given CFG in Greibach normal form that simulates the leftmost derivations of the CFG. A lemma is also proved to show the languages generated are equivalent.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    49 views3 pages

    Equivalence of PDAs and CFGs (Proof)

    Uploaded by

    Nehal Gupta
    This document shows that pushdown automata (PDAs) and context-free grammars (CFGs) are equivalent in expressive power by proving two things: 1) Given any CFG, a PDA can be constructed that accepts the same language generated by the CFG. 2) Given any PDA, a CFG can be generated that produces the same language accepted by the PDA. It first proves part 1 by constructing a PDA from a given CFG in Greibach normal form that simulates the leftmost derivations of the CFG. A lemma is also proved to show the languages generated are equivalent.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    Equivalence of PDAs and CFGs

    We will now show that pushdown automata and context-free grammars are equivalent in
    expressive power, that is, the language accepted by PDAs are exactly the context-free
    languages. To show this, we have to prove each of the following:

    i) Given any arbitrary CFG G there exists some PDA M that accepts exactly the same language
    generated by G.

    ii) Given any arbitrary PDA M there exists a CFG G that generates exactly the same language
    accpeted by M.

    (i) CFA to PDA

    We will first prove that the first part i.e. we want to show to convert a given CFG to an equivalent
    PDA.

    Let the given CFG is . Without loss of generality we can assume that G is in
    Greibach Normal Form i.e. all productions of G are of the form .

    where and .

    From the given CFG G we now construct an equivalent PDA M that accepts by empty stack.
    Note that there is only one state in M. Let

    , where

     q is the only state


     is the input alphabet,
     N is the stack alphabet ,
     q is the start state.
     S is the start/initial stack symbol, and , the transition relation is defined as follows
    1.

    For each production , .

    We now want to show that M and G are equivalent i.e. L(G)=N(M). i.e. for any

    . iff .

    If , then by definition of L(G), there must be a leftmost derivation starting with S and
    deriving w.

    i.e.
    Again if , then one sysmbol. Therefore we need to show that for any .

    iff .

    But we will prove a more general result as given in the following lemma. Replacing A by S (the
    start symbol) and by gives the required proof.

    Lemma For any , and , via a leftmost derivative iff

    Proof : The proof is by induction on n.

    Basis : n = 0

    iff i.e. and

    iff

    iff

    Induction Step :

    First, assume that via a leftmost derivation. Let the last production applied in their

    derivation is for some and .

    Then, for some ,

    where and

    Now by the indirection hypothesis, we get,

    .............................................................................(1)
    Again by the construction of M, we get

    so, from (1), we get

    since and , we get

    That is, if , then . Conversely, assume that

    and let

    be the transition used in the last move. Then for some

    , and

    where and .

    Now, by the induction hypothesis, we get

    via a leftmost derivation.

    Again, by the construction of M, must be a production of G. [


    Since ]. Applying the production to the sentential form we get

    i.e.

    via a leftmost derivation.

    Hence the proof.

    You might also like