In this video, i have explained Regular Expression to Finite Automata Conversion with following timestamps:

0:00 – Theory of Computation lecture series
0:45 – Rules for Converting RE to FA
3:54 – Example-1
7:48 – Example-2
10:39 – Example-3

Following points are covered in this video:

1. Regular Expression to Finite Automata Conversion
2. Rules of RE to FA
3. Different Examples of RE to FA

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

#REToFA, #REtoFAExamples, #TOC, #TheoryofComputation, #AutomataTheory, #EngineeringFunda