Section outline

  • November 21st, Friday (10:30-12:30)

    Properties of context-free languages

    • Closure of CFL under string reversal
    • CFL and intersection
    • Intersection between CFL and regular languages
    • Other closure properties for CFL

    Exercises

    • Let \( L = \{ a^nb^n \; | \; n \geq 1 \} \) and let \( L' = \{ a,b \}^+ \). State whether the the following three languages are regular: \( L \cdot L' \), \( L' \cdot L \), \( L' \cdot L \cdot L' \)

    References

    • Hopcroft et al., chapter 7