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.

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 corresponds roughly with Chapters 1 to 7 of the textbook for
this course.

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.