Theory of Computation
Aug - Nov 2022

Tutorials

Following is a tentative tutorial schedule.

Tutorial 1 (30 Aug, Tuesday) : Design of DFAs and languages accepted by DFAs

Based on practise psets : PPS 1

Tutorial 2 (11 Oct, Tuesday) : NFAs, Equivalences between DFA, NFA and reg languages, Pumping lemma

Based on practise psets : PPS 1, 2, 3 and 4

Tutorial 3 (18 Oct, Tuesday) : More on NFAs and DFA minimization

Based on practise psets : PPS 2, 4 and 5

Tutorial 4 (14 Nov, Monday) : On Myhill Nerode-relations and context-free languages

Based on practise psets : PPS 5 and 6

Tutorial 5 (22 Nov, Tuesday) : More on context-free languages and pumping lemma

Based on practise psets : PPS 6