In this video, i have explained Minimization of Deterministic Finite Automata with following timecodes:
0:00 – Theory of Computation Lecture Series
0:19 – Example
1:04 – Drawing the triangle
1:17 – Step-1 of Triangulation Method
2:22 – Step-2 of Triangulation Method
9:38 – Iteration 2 of Step-2
10:39 – 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. Non-reachable region

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

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