Regex to NFA Conversion Isn't Hard! (Sipser 1.28a)
43.7 هزار بار بازدید -
3 سال پیش
-
Here we do an example
Here we do an example of the regular expression to nondeterministic finite automaton (NFA) conversion. The basic idea is to make a small NFA for the "indivisible" pieces, then combine them using union, concatenation, and star as the case may be.
Easy Theory Website: https://www.easytheory.org
Discord: Discord: discord
If you like this content, please consider subscribing to my channel: @easytheory
▶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.
Easy Theory Website: https://www.easytheory.org
Discord: Discord: discord
If you like this content, please consider subscribing to my channel: @easytheory
▶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.
3 سال پیش
در تاریخ 1400/07/17 منتشر شده
است.
43,714
بـار بازدید شده