NPTEL Lecture : 'Lecture-36-Example continued. Finiteness of TM description, TM configuration, language acceptance, definition of recursively enumerable (r.e.) languages.'

Lecture-36-Example continued. Finiteness of TM description, TM configuration, language acceptance, definition of recursively enumerable (r.e.) languages.

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