In this video, i have explained Minimization of Deterministic Finite Automata with following timecodes:
0:00 – Theory of Computation Lecture Series
1:44 – Moore Machine definition
3:08 – Example of Moore Machine
5:14 – Tracing of a string on Moore Maching
6:42 – Important note on Finite Automata with Output

Following points are covered in this video:
1. Finite Automata with Output
2. Types of FA with output
3. Moore Machine
4. Tracing of string on moore machine
 
Engineering Funda channel is all about Engineering and Technology. Here this video is a part of Theory of Computation.
#FAwithOutput, #Mealy, #Moore, #TheoryofComputation​, #TOC