ARDEN'S THEOREM IN AUTOMATA THEORY || EQUIVALENCE OF TWO REGULAR EXPRESSIONS || DFA TO RE || TOC

[@johnvictor9542]

Hi sir 😊 Your teaching is very nice! Keep going 🤗

[@sonukumarnirala6896]

Nice explanation guruji

[@m.kalpana3391]

Thank you sir... We r waiting for more videos

[@leoyt2651]

in 6:07 Last but one step Q(Epsilone+P*P) where, Q*Epsilone = Q Final Answer Should Be Q+QP*??

[@varatikesava654]

(P*P) gives you P+ (epsilon + P+) gives you P* finally Q(P*) = QP*

[@Ritzieworld]

As usual sir you have cleared my doubt .. 1 is E in automata or we can say P^0

[@worldcutebabies9486]

It's my request can u please do videos on sql because now a days it's very important

[@rohitdeore6028]

Thank you sir❤

[@kennadysil7806]

Thank you🙏 sir

[@mohdmasaoodraza9315]

Thnkuu sir

[@kalyanibadgujar2530]

I have doubt what about R Q+QP+QP^3+RP4

[@tejasreegunda5552]

Yes sir ur commen the Q value bt where is the r in the last of expression

[@wKaransingh]

R will tend to infinite since we are recursively resubstituting it in equation

[@VishalKumar-bj4nl]

❤❤

[@sadhanaraju5580]

Hi sir, important questions jntua r19

[@good114]

Thank you Sir 🙏🙏🙏🙏❤️❤️❤️

[@divyaagarwal3091]

Thankyou so much sir