Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC

[@BHARAT_6_3_05]

Thankyou for a Nice explanation sir

[@rohitkartikkkk]

Genuine Teacher

[@srijansingh8837]

never knew dino james was so good at automata

[@shreyask1832]

😂

[@ornimo9392]

😂😂

[@abhijeetvishwakarma4481]

Absolutely Amazing Explanation sir

[@deekshapal5993]

Amazing sir👍 All doubts clear

[@shuvam_roy-x6p]

nicly explained sir...thank you sir🙏

[@PushkarGarg-ix2sk]

thank you so much sir

[@AyanKhan-zh8vr]

Nice Explaination👍

[@factsandanalysis5985]

Sir, answer should be a+a(ba)*

[@muhammadtalhaidrees]

If (ba)* = null in a(ba)* then single a is also accepted thus there is no need of a+a to accept single a

[@astergaming2261]

wow tq

[@arnavkamra3346]

sir what is ur state?

[@prashantkumaryadav1220]

Awsome sir ..all clear

[@m.abdullahfiaz9635]

Professor😍

[@legendaizy482]

First class

[@forkanfahimfhf6563]

tnq soooo much

[@thetechmask]

Sir can I have the previous video (Arden's video)

[@Venom-zj2ls]

🙌🤝

[@gabrielferreira9849]

can you speak english?