In this video, i have explained Minimization of Deterministic Finite Automata with following timecodes:
0:00 – Theory of Computation Lecture Series
1:03 – Drawing the Triangle for given DFA
1:32 – Step-1 of Triangulation Method
3:40 – Step-2 of Triangulation Method
7:46 – Step-3 of Triangulation Method
9:03 – 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. Triangulation Method (Myhill Nerod Theoram)

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

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