Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC
ฝัง
- เผยแพร่เมื่อ 15 ก.ย. 2024
- #fatore, #stateelimination, #GATECS, #TOC, #automatatheory
state elimination method regular expression || state elimination method dfa to regular expression || state elimination method examples || finite automata to regular expression || fa to regular expression || fa to re conversion || fa to re conversion examples || finite automata to regular expression using state elimination
This lecture shows how to design the Regular Expression for a given Finite Automata using State Elimination Method.
State Elimination Method :
Rules to convert a DFA/NFA//Ɛ-NFA into corresponding Regular Expression.
Rule-1 :
If there are no incoming edges to the start state proceed further to check other rules. If there are incoming transitions to the initial state, then make new start with no incoming edges and an outgoing edge to the old start state with Ɛ-transition. the initial state before is now normal state with added incoming Ɛ-transition.
Rule-2 :
If there are no outgoing edges from final state proceed further to check the last rule. If there are outgoing transitions from final state, then make new final state with no outgoing edges and an incoming edge from old final state of Ɛ-transition. Old final state is transformed into normal state with the added transition of Ɛ.
Rule-3 :
If there are no multiple final states proceed to elimination (except final and initial) of normal states. If the Automata have multiple final states then convert into single final state add outgoing Ɛ-transition to new and only final state with no outgoing transitions.
Rule-4 :
eliminate all states one by one except starting and final state.
Contact Details (You can follow me at)
Instagram: / thegatehub
LinkedIn: / thegatehub
Twitter: / thegatehub
...................................................................................................................
Email: thegatehub2020@gmail.com
Website: thegatehub.com/
...................................................................................................................
📚 Subject Wise Playlist 📚
▶️Data Structures: tinyurl.com/bwp...
▶️Theory of Computation: tinyurl.com/5bh...
▶️Compiler Design: tinyurl.com/2p9...
▶️Design and Analysis of Algorithms: tinyurl.com/ywk...
▶️Graph Theory: tinyurl.com/3e8...
▶️Discrete Mathematics: tinyurl.com/y82...
▶️C Programming:tinyurl.com/255...
#StateElimination #FiniteAutomataToRegularExpression #FAtoRE #FAtoREConversion #StateEliminationMethod #DFAtoRE #NFAtoRE #RegularExpressions #RegularExpressionGeneration #RegularExpressionExamples #RegularExpressionTutorial #RegularExpressionJava #RegularExpressionPython #RegularExpressionOnline #RegularExpressionCSharp #RegularExpressionTOC #RegularExpressionGenerator #StateEliminationMethodExamples #ArdenMethod #RijMethod #RegularExpressionDFA #RegularExpressionNFA #EquivalenceOfDFA #RegularLanguage #FiniteAutomata #DFA #NFA #AutomataTheory
best explanation on dfa and regular expression,please share this channel with your friends and collegue..to support him,
bestest content and mainly the explanation is awesome. Thanku sir
sir, yaha pure expression ko whole star nhi ayega kya ??? wo confusion h
plzz replyy
no only the loop expression contain * symbol
bahot acchha explain kiye apne Sir
Amazing explanations thanks ❤️
Thank you ❤️☺️❤️☺️❤️
thank you so much, sir
Thank you so much sir
Sir can we eliminate q3 ... actually I start eliminating from q3 and my answer is not matches with with urs it's ok to have multiple of regular expression for one particular FA
Yes.. you can eliminate any state.. you can get multiple regular expression from the same finite automata.
But how to verify that our resultant RE is right or not
@funfoodie1302 aapka ans kya aaya tha....plz bataye
Nice sir
[E+(a+b)b][b(a+b)b+bb]* is it correct, I have remove edges like this - q2, q3, q1
Correct 👍
That bb part is it (bb)* or bb only?