NPTEL Video Course : Theory of Automata, Formal Languages and Computation

Lecture 35 - POST'S Correspondence Problems (Continued.), Time and Tape Complexity of TM