COMPILER DESIGN: UNIT-2 LEXICAL ANALYZER (PART-3) | Thomson method | RE TO NFA | NFA TO DFA

Finite Automata From a Regular Expression, NFA using THOMPSON'S RULE, DFA using Subset Construction method, Optimization of DFA

[pradipkafle]

"aap insan nahi bhagwan ho", struggling to understand this since the start of my semenster.Thank you very much for this video.

[sourav_chhotray]

Thank you so much, unable to find any clear video in compiler designer for this topic.
This one is one of the best!

[Googlinghelpers]

Finally somebody explained thomson rule .

[maulikpatel]

Bhai mai is subject me ek dum khtm insaan hu bt apki vjah se lgta hai pass ho jaunga .
Don't have words to thank you man ✌️❤

[ColleGPT]

bhai bahout easy way me samjaya hai you so much bhai❤❤‍🔥❤‍🔥❤‍🔥

[sreyavarmakalidindi]

Best explanation of all videos for nfa to DFA 💯

[kabeer]

Thankyou so much sir all the concepts clearly covered in one video ❤❤

[kaifmalek]

Thank You for making this video it is very helpful😊

[sb-hwang]

Thank you so much. you are my savior! ❤💯

[JustwaitNwatch-w]

how many states will be there in total for a(b | c)*a*c following your method i got 15 states in total but chat gpt says it will be 16 because you have to add an epsilon transition from end state of a* to start state of c.
but in your example (a|b)*abb you have not added any epsilon transition after (a|b)* to a
please clarify

[dhruvrajvyas]

For (a | b)*a(a | b) does I have to draw ( a | b) two times or only one time while concetenation

[divyanshu]

why is there a null in some of the expressions ?

[ahteshamshakeel]

question no 4 (a* | b* ) how to convert into NFA

[Priya-nueq]

When we draw nfa then # is included or not?

[rachamallarahul]

Thanks... Nobody not posted this unit..

[bhumikabansal]

Sir please do share the PDF of exercise question

[SherazVerses]

kfueit se prhne k bad yahn ana farz hai ap per, , compiler itna mushkil nhi jinta hmy btaya gya tha, ,