NPTEL Lecture : 'POST'S CORRESPONDENCE PROBLEMS (Contd), TIME AND TAPE COMPLEXITY OT TM '

POST'S CORRESPONDENCE PROBLEMS (Contd), TIME AND TAPE COMPLEXITY OT TM

  • Course: Theory of Automata, Formal Languages and Computation
  • Discipline: Computer Science and Engineering
  • Faculty: Prof. Kamala Krithivasan
  • Institute: IIT Madras