In this video, i have explained Minimization of Deterministic Finite Automata with following timecodes:
0:00 – Theory of Computation Lecture Series
0:19 – Example of DFA with Non-reachable state
0:30 – Definition of Non-reachable state
1:08 – Applying Partition Method
1:27 – Creating Partition P1
1:59 – Creating Partition P2 by checking transitions
4:32 – Creating Partition P3 by checking transitions
5:24 – Creating Partition P4 by checking transitions
6:09 – Terminating Condition
6:30 – Drawing the minimized DFA

Following points are covered in this video:
1. Minimization of DFA (MFA)
2. Minimization of DFA Examples
3. State Reduction
4. Partition Method

Engineering Funda channel is all about Engineering and Technology. Here this video is a part of Theory of Computation.

#MinimizationOfDFA, #MFA, #StateReduction, #TheoryofComputation, #PartitionMethod, #TOC, #EngineeringFunda