5:01:32
**UNIT 1**

Finite Automata: Why Study Automata Theory?, Structural Representations, The Central Concepts of Automata Theory Part - 1, The Central Concepts of Automata Theory Part - 2, Automation & Acceptance of a String by a Finite Automation, Finite Automation, Transition Systems, DFA Part 1, DFA Part 2, NFA, Design of NFA, Find out DFA (or) NFA & Differences Between DFA and NFA, Equivalence of DFA and NFA Part - 1, Equivalence of DFA and NFA Part - 2, Conversion of NFA into DFA Part - 1, Conversion of NFA into DFA Part - 2, Finite Automata with E-Transition Part - 1, Finite Automata with E-Transition Part - 2, Finite Automata with E-Transition Part - 3, Conversion of NFA with E-moves to NFA without E-moves Part - 1, Conversion of NFA with E-moves to NFA without E-moves Part - 2, Conversion of NFA with E-moves to NFA without E-moves Part - 3, Conversion of NFA with E-moves to NFA without E-moves Part - 4, Conversion of NFA with E-moves to NFA without E-moves Part - 5, Minimization of Finite Automata Part - 1, Minimization of Finite Automata Part - 2, Minimization of Finite Automata Part - 3, Minimization of Finite Automata Part - 4, Minimization of Finite Automata Part - 5, Minimization of Finite Automata Part - 6, Moore Machine Part - 1, Moore Machine Part - 2, Mealy Machine Part - 1, Mealy Machine Part - 2, Conversion of One machine to another Part - 1, Conversion of One machine to another Part - 2, Conversion of One machine to another Part - 3, Applications and Limitation of Finite Automata.