DFA to Regular Expression by State Elimination method in TOC| State elimination examples in automata

[@SanjaySingh-ud5ju]

You always teach so well as easy to understand madam🙌

[@CSEconceptswithParinita]

Thanks for your feedback 😊

[@niveditahajra9325]

Beautifully explained

[@CSEconceptswithParinita]

Thanks for your feedback 😊

[@rrahulrroyr]

Awesome explanation ... Thank you !!

[@CSEconceptswithParinita]

You're welcome 😊

[@fekadugudisa7]

best explanation keep up...

[@CSEconceptswithParinita]

Thanks for acknowledging! Keep learning, keep sharing ✌ 🙂

[@shreyash4415]

Nice explanation mam😍

[@CSEconceptswithParinita]

Thanks 😊

[@dollysrimani1049]

Congratulations for 1k subscribers 👑🏆

[@CSEconceptswithParinita]

Thanks a lot 💓

[@ashmitasaha4681]

Thank u maam..

[@CSEconceptswithParinita]

You're welcome 😊

[@sudiptahajra8974]

Amazing explanation

[@CSEconceptswithParinita]

Thank you for acknowledging :)

[@manjoydas1455]

I have two questions.
1) Is this a proper DFA? What I meant was that (A,1)=? and (B,0)=?
2) What happens if the start and accepting states are same? For example, (q0,a)=q1, (q0,b)=q3, (q1,a)=q2, (q1,b)=q0, (q2,a)=(q2,b)=q2,(q3,a)=q0,(q3,b)=q2 and q0 is both the initial and final state.

[@musicalofworld]

How can I contact with you?

[@dance_j]

x^+ and x^+ x^(*+) can u plz solve this regular expression? I want this❤