What Happens If the FA Has Multiple Final States? But the tricky part is: we need a single start state in the reversed automaton. So, to achieve this, we add a new start state in the reversed FA. This new state will have epsilon transitions (transitions that happen without consuming any symbol) to all the original final states. These epsilon transitions allow the FA to start at any of the original final states in the reversed language.
VERY PERFECT THANK YOU SIR
What Happens If the FA Has Multiple Final States?
But the tricky part is: we need a single start state in the reversed automaton. So, to achieve this, we add a new start state in the reversed FA. This new state will have epsilon transitions (transitions that happen without consuming any symbol) to all the original final states. These epsilon transitions allow the FA to start at any of the original final states in the reversed language.
u r the awesome.,..
very nice sir😍😍😍
If there is more than two final state in the FA then what should we do ??
Is me make more than one starting state??
Yes sir
Dino bhai hiphop ke saath ye bhi karte hai aaj pata laga
Wow
cant unsee now 😂😂😂
@@chahatbhatia2157 Your English song playlist is so cool👍
@@chahatbhatia2157please unsee dear🥺🥺
😭😭
Good Lecture
Thank you sir ❤❤
At first my head got dizzy after looking at the procedure of reversing the FA and then reversing the language. 🤣🤣🤣🤣🤣🤣
🤩🥰
But A goes to epsilon is not part of ur language but ur LLG generates it
here when we take the new F.A starting state will be B and not A, this will give the desired result.
Nice Explanation but NIKHIL SAKHARE IS FATHER OF TOC 🦁
kon h ye ? search karne mein bhi nhi aata 😂
@@sunphooleditswohi😂😂😂
❤️❤️❤️❤️
Kvj