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
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.
En esta página del sitio puede ver el video en línea Regex to NFA Conversion Isn't Hard! (Sipser 1.28a) de Duración hora minuto segunda en buena calidad , que subió el usuario Easy Theory 09 octubre 2021, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 51,090 veces y le gustó 971 a los espectadores. Disfruta viendo!