Section outline

  • Topics: - Pumping Lemma for regular languages

                - Applications

                - Decision problems for finite-state automata

                - context-free grammar and context-free language

                - left derivation and leftmost derivation

                - unambiguous context-free grammar and language

                - inherently ambiguous context-free language

                - syntax trees

             

    Seminary: one-hour written mid-term exam

    • AuGLecture7 Datei

      Slides for Lecture 7

      (Update: April 5, 2018)

    • SS2018_A7 Datei

      The solutions to these problems are to be presented and discussed in the Seminary on April 12, 2018.

    • SS2018_A7_SOL Datei

      This file contains solutions to selected problem from Assignment 7.