In this video, i have explained Minimization of Deterministic Finite Automata with following timecodes:
0:00 – Theory of Computation Lecture Series
0:14 – Partition Method
0:47 – Equivalency between states
3:13 – Example
7:22 – Terminating condition of Partition Method
8:25 – 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, #PartitionMethod, #StateReduction, #TheoryofComputation, #TOC, #EngineeringFunda