NPTEL Lecture : 'Lecture-22-Parse trees, inductive proof that L is L(G). All regular languages are context free.'

Lecture-22-Parse trees, inductive proof that L is L(G). All regular languages are context free.

  • Course: Theory of Computation
  • Discipline: Computer Science and Engineering
  • Faculty: Prof. Somenath Biswas
  • Institute: IIT Kanpur