Рет қаралды 7,224
Here we do an example of the NFA to DFA conversion, otherwise known as the "powerset construction", which solves problem 1.17 in the Sipser textbook. The problem first asks to create an NFA for the given regex, which is easy enough to do.
Easy Theory Website: www.easytheory...
Discord: / discord
If you like this content, please consider subscribing to my channel: / @easytheory
▶SEND ME THEORY QUESTIONS◀
ryan.e.dougherty@icloud.com
▶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.