Ch-3.2: Introduction to Turing Machines and Their Acceptance Capabilities

In this lecture i discussed Turing Machine Introduction TM as Language Accepter Acceptance by TM: After taking input string there are 3 possibility of TM 1.May go to final halt. 2.May go to non final halt. 3.May go to loop. ----------------------------------------------------------------- Subscribe my channel for more updates https://www.youtube.com/monalisacs ---------------------------------------------------------------------- Theory Of Computation Lecture https://www.youtube.com/watch?v=vDJjYGui3Ho&list=PL767-rEuXhcPQWMuHXOCZzj5PqF9YBVZt ------------------------------------------------------------------- TOC GATE Previous Questions Solved by Monalisa https://www.youtube.com/watch?v=K5wIww1OnCY&list=PL767-rEuXhcN7sn9TCRxhmvDpG7RLT3UK ------------------------------------------------------------------- Data Structure Lecture: https://www.youtube.com/watch?v=mYDsGejk3zg&list=PL767-rEuXhcMiMbX4IU_oqWshY6z8Rc7j --------------------------------------------------------------------- Data Structure Previous 10 year Questions: https://www.youtube.com/watch?v=mYDsGejk3zg&list=PL767-rEuXhcOWUPgW1RrIkUKAle1YBdh1 ----------------------------------------------------------------------- #TuringMachine#REL#TOC