Finite State Machine (FSM) - TOC Hindi Tutorial

Welcome to third video of tutorial series of Theory of Computation - TOC in Hindi.
In this video, we have discussed about Finite state machine also known as Finite Automata or Finite State Automata. We have done detail discussion on it. Also we have classified it into two ways Finite State Machine as Acceptor or Boolean output or without output and Finite State Machine as Transducer or with output.
With the help of some numerical discussion we discussed how to prepare "Finite State Machine as Acceptor or Boolean output or without output".

We have started this series for the student of Computer Science for making their better understanding on theory of Computation. We will discuss each topic in a way such that one can better prepare themselves for GATE Examination, BE / B.Tech Exams, or other competitive exams.

Channel Link: https://www.youtube.com/channel/UCsYdRF7HC_XptDEmuLKZX4A

Playlist:
https://www.youtube.com/playlist?list=PLX6MPU0rfYSJMcTakJ-cUoeeKZehGovFd

Speaker: Piyush Garg, Asst. Professor, Department of CSE, Corporarte Institute of Science and Technology, Bhopal.