Osnova sekce

  • Topics: - DFAs only accept regular languages

                - Nerode relation

                - Theorem by Myhill and Nerode

                - equivalence class automaton

                - minimal DFA

                - algorithm for minimizing a DFA

                - nondeterministic finite-state automaton (NFA)

                - power set construction

    • AuGLecture3 Soubor

      Slides for Lecture 3

      (Update March 09, 2018)

    • SS2018_Assignment3 Soubor

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

      (Update: March 8, 2018)

    • SS2018_A3_SOL Soubor

      This file contains solutions to selected exercises from Assignment 3.