Hide menu

TDDD14/TDDD85 Formal Languages and Automata Theory

Resources


Both groups will get help by one assistant in the rooms given in the schedule. During the tutorials you can also get help and ask questions on the Zoom link given in the schedule.

Tutorial material

#1 Basic Concepts
#2 Finite Automata
#3 Regular Expressions and Minimization of DFA's
Alternative solutions for 3.5, using GNFA construction
#4 Regular Languages
#5 Deadline for homework 1. Potential solutions will be discussed during this session.
#6 Context-Free Grammars
#7 Regular grammars, PDA's, and Properties of CFL's
#8 LR-Grammars
#9 Turing Machines and deadline for homework 2. Potential solutions will be discussed during this sesssion.

Page responsible: Victor Lagerkvist
Last updated: 2022-04-12