2 - Convert Regular Expression to Finite-State Automaton

[obviousninja1]

Great. i wish all my teachers are like you. =.=

[miselj]

awesome job on explaining it simple and easy by breaking it down into steps. also some i have come across in my class involve a lot of (A U B)+(J U K).. could you do a few of the star and plus that are used on unions and also used on sequential (XY)

[Icescream08]

Can u make a finite state on this? (a|b)* ?

[Ludio1979]

Brilliant! It's amazing what a difference the teacher makes.

[tusharbhushanrocks]

thanx i cud pass my exams now

[MuhammadElOrabi]

Thanks a million!

[LaughingWargod]

more more i hunger for more

[papoboo]

thank you so muchhh and PLZZ do more pumping lemma

[TheMaryam2222]

sir u r just awesome .... u can make more videos on comp sc topics .. !!! like compiler design or automata theory etc...i m waiting

[khalifamak123]

This is 110% explanation, I attended a course in MSc level in UK university which have this as the most complex issue...!!! you made it as great as your tutoring , pls.. make more videos quickly for desperate students through the world ...Your explanation is at the level of a super star professor level -- suggesting to youtube to declare such a prize --u r a real winner.thanks alot

[AJSwisgirl]

Thanks...!!

[absar45]

sir you are great ..plz plz go through the other topics and make more videos

[profbbrown]

@absar45 Which other topics would you like?

[absar45]

@profbbrown Topics are transistion graph ,converting RE to FA,kleens theorm.....

thanks in advanced

[ishanutube707]

@profbbrown Pumping Lemma