Regular Expression (Regex) to NFA Conversion

Published: 04 August 2020
on channel: Easy Theory

31,868

593

Here we cover the regular expression (regex) to NFA conversion. The idea is to revisit the definition of regex, and to make an NFA for each of the 6 pieces of the definition. For the first three, we can make either a 1-state or a 2-state NFA. For the other three (the "inductive" cases), we revisit earlier constructions with NFAs using union, concatenation, and star to make an NFA for the "bigger" regex, using "smaller" NFAs that have already been built.

If you like this content, please consider subscribing to my channel: / @easytheory

▶ADDITIONAL QUESTIONS◀
1. What does the NFA for the regex ab look like?

▶SEND ME THEORY QUESTIONS◀
[email protected]

▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.

On this page of the site you can watch the video online Regular Expression (Regex) to NFA Conversion with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 04 August 2020, share the link with friends and acquaintances, this video has already been watched 31,868 times on youtube and it was liked by 593 viewers. Enjoy your viewing!

2,666