Regular Expression (Regex) to NFA Conversion

Опубликовано: 04 Август 2020
на канале: 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.

На этой странице сайта вы можете посмотреть видео онлайн Regular Expression (Regex) to NFA Conversion длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Easy Theory 04 Август 2020, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 31,868 раз и оно понравилось 593 зрителям. Приятного просмотра!

350