NFA to DFA Conversion- NFA with Epsilon to NFA without epsilon- Lecture

This lecture describes one of the method/ algorithm of Theory of Automata and Computation: converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata). Lecture by: Dr. Arashdeep Kaur (B.Tech-CSE, M.Tech-CSE, PhD-CSE), Assistant Professor, Department of Computer Science & Engineering, Amity University, Noida, India. There are two types of NFA 1. with epsilon 2. without epsilon Both NFAs are treated differently while converting to DFA. This video describes the conversion of NFA with epsilon to NFA without epsilon or we can say that NFA with epsilon to DFA.