Lecture 14:Conversion of Regular Expression to NFA using Thompson's Construction 

This is the best explanation out there. Every thing is perfectly explained.

Best explanation . Every concept is perfectly explained.

Perfectly explained. Thank you sir😁

thanks for your concise explenation 🙏

Thank you sir. Very good explanation. 👍

Thank you sir , very infromative

self assessment Q2 number of states=2n+2k+2u-c ?? it takes 2 states to define a symbol, every concatenation reduces the number of states by 1, every Kleene closure increases the stakes by 2, and the same with the union.

Thank you sir, for this perfect explanation

Thank you so much 💓 💗... 💗 💛 💖

lifesaver 👏👏👏

thanks🙏🏻🌸

please can i have the solution for question 1 from the self assessment. Great inspiration sir i just got to know about this from you only. Love from canada sir.

thank you sir

expression L = a (a + b)* b will be same or not using Thomson construction method ?

Thank you sir, very well explained.

How can we solve this (aa/b)* (a/cc)* please I need your assistance. Thanks

salute sir 🫡🫡🫡🫡🫡

figure for (0+1)* +1