DFA to Regular Expression Conversion

preview_player
Показать описание
TOC: DFA to Regular Expression Conversion

This lecture shows how to design the Regular Expression for a given DFA.

Music:
Axol x Alex Skrindo - You [NCS Release]
Рекомендации по теме
Комментарии
Автор

Q4 is left out of the final expression due to the fact that it is a sink state, a state that locks in anything that is not accepted by the machine. The regular expression derived matches the accepting state of the DFA. If you are unsure, go ahead and generate some strings using the regular expression. Then try to see if you can get to an accepting state of the DFA with the generated strings.

TheJohnJaded
Автор

Book : Mishra and Chandrasekaran ; Page no 149 (3rd ed), example 5.9.

suvankar
Автор

These gonna make no difference in our lives but thanks(!) to our school system, yet we are here... Thank you Neso for helping us fight against this shtty sistem.

denizyunusgogus
Автор

You are the best .... U make everything so simple. I am so thankful to you.

deependra
Автор

Thank you so much for explaining in such a simple and understandable way. :)

deependrabajracharya
Автор

U make the DFA to rexp be simple, Really. The best video for that.

caesarshi
Автор

very thankful to you sir, , it is very helpful for, clear explanation. i like the presentation of lectures... hope keep going

vedhuvolgs
Автор

Thanks for this Theory of Computation video! Is there a problem that you want to see done?

EasyTheory
Автор

Tooo good simply explaination thank uuuu

queenofmyworld
Автор

What about state q4 equation?? And what if there are multiple accepting states

jettipremkumar
Автор

That Q4 state is useless, it will be considered as dummy state or a dead state since there is no transition to get back from Q4. But, to get a Complete DFA, we need to introduce this dummy state . If we just need a DFA (not complete) we can simply remove Q4 state. Am I right ?

umamanikantaikkurthi
Автор

Explain how you determine when to substitute in? In this example you substituted q1 and q2 in the previous exercise there seemed to be selective substitution. Do you automatically substitute equation for the highest state or do you substitute equations for all the states into final state?

CLG
Автор

Thanks sir. How do solve this when there are more accepting states?

wnstnn
Автор

i cant find the previous lecture that explains the steps, please drop link

gbemisolaagboola
Автор

Very good and funny videos bring a great sense of entertainment!

terraknight
Автор

clean and wonderful explanation ... Awsome .. : )

Coolpratik
Автор

Thank you so much sir it helps me a lot🙏🙏🙏🙏🙏

_krishna.words_
Автор

And what if there are more final states than one?

stanrichie
Автор

What if q2 q3 isn’t written in terms of q1? What then?

pennysmith
Автор

if multiple final states are there, what we have to do

saikumarsetti