This course covers fundamental concepts and theory in the fields of
Automata Theory, Formal Language Theory, and Complexity Theory,
including regular languages, context-free languages, and decidable
languages and their computational models, viz. NFAs, PDAs, and TMs. In
addition NP-completeness is treated. The
above is covered by Chapters 2 to 10 of the textbook for
this course.
- Teacher: Rick Erkens
- Teacher: Erik Vink, de
- Teacher: Renata Medeiros de Carvalho
- Teacher: Natalia Sidorova
- Teacher: Irina Tentina
- Teacher: Floor Ummels
- Teacher: Francesca Zerbato