In this video, i have explained RE to FA Examples with following timestamps:

0:00 – Theory of Computation lecture series
0:34 – Example-1
4:51 – Example-2

Following points are covered in this video:

1. Regular Expression to Finite Automata Conversion Example
2. Generating Non Deterministic Finite Automata for Given Regular Expression

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

#REToFA, #AlgorithmREtoFA, #NFA, #TOC, #TheoryofComputation, #AutomataTheory, #EngineeringFunda