Converting Regular Expressions to ε-NFAs - Thompson's Construction (Kleene's Theorem (Part 1))

In today's lesson, we see one major part of a standard characterization of the regular languages often referred to as Kleene's Theorem. In this lecture, we'll see one aspect of it, how to turn any regular expression into a finite automaton!

Time Stamps:
0:00 Kleene's Theorem
8:43 Statement we will prove, proof and Thompson's construction
41:58 Example of applying Thompson's construction
48:42 Closing

Have a beautiful day!

Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Eric R
Patreon Supporters (Supporter Access!):

-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:

Follow also at:

#ComputerScience
#regularexpression
#theoryofcomputation