Section outline

  • November 19th, Wednesday (10:30-12:30)

    Properties of context-free languages

    • Lemma on parse trees in CNF
    • Proof of pumping lemma for CFL
    • Example of application of the pumping lemma for CFL
    • Properties of CFL that can be derived from the pumping lemma
    • Exercise with solution

    References

    • Hopcroft et al., chapter 7