Section outline

  • October 1st, Wednesday (10:30-12:30)

    Course administration and presentation

    • Course timetable
    • Textbook & other material
    • Content outline & final exam
    • Statistics

    Introduction to the theory of automata

    • Examples of computational models
    • Recognition models and generative models
    • Proof techniques (to be revisited later)
    • Basics of formal language theory: alphabet and strings
    • Power of an alphabet and \(\Sigma^\ast\)

    References

    • Hopcroft et al., chapter 1