Lecture 5: CF Pumping Lemma, Turing Machines

Om kurset

Description: Quickly reviewed last lecture. Proved the CFL pumping lemma as a tool for showing that languages are not context free. Defined Turing machines (TMs). Defined TM deciders (halt on all inputs). Instructor: Prof. Michael Sipser