Osnova sekce

  • Topics: - Pumping Lemma for context-free languages

                - Applications

                - Context-free languages over a single-letter alphabet

                - Pushdown Automata (PDA)

                - Acceptance by empty pushdown and by final state

                - Each context-free language is accepted by a PDA

    • AuGLecture9 Soubor

      Slides for Lecture 9

    • SS2018_A9 Soubor

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

    • SS2018_A9_SOL Soubor

      This file contains solutions to selected problems from Assignment 9.