Section outline

  • Push Down Automata and Properties of Context Free Languages: Nondeterministic Pushdown
    Automata (NPDA)- Definition, Moves, A Language Accepted by NPDA, Deterministic Pushdown
    Automata(DPDA) and Deterministic Context free Languages(DCFL), Pushdown Automata for
    Context Free Languages, Context Free grammars for Pushdown Automata, Two stack Pushdown
    Automata, Pumping Lemma for CFL, Closure properties of CFL, Decision Problems of CFL,
    Programming problems based on the properties of CFLs.