Languages and Automata

This course introduces the basics about regular languages and their various representations (finite-state automata, regular expressions and regular grammars). In the past, this course also introduced the Floyd verification method on finite-state automata extended with variables.

This course occurs in the Bachelor degree (License) in Computer Science.

My roles:

  • Responsible for the course.
  • Teaching the french lecture.
  • Teaching the english tutorial.

Teaching material and administrative information can be retrieved on the dedicated Moodle.