This video will give an overview of Thompson Construction algorithm along with explaining different rules that it follows to convert any Regular Expression to Epsilon NFA which further can be converted to normal NFA as well. Multiple example questions have been used to explain the complete process.

Watch more videos here:
1. Introduction to TOC :    • Lec 1 | Introduction to TOC | TAFL | ...  
2. Halting Problem of Turing Machine :    • Lec 94 | Halting Problem of Turing Ma...  
3. Post Correspondence Problem :    • Lec 87 | Post Correspondence Problem ...