Conversion of Regular Expression to Finite Automata - Examples (Part 3)

TOC: Conversion of Regular Expression to Finite Automata - Examples (Part 3)

This lecture shows an example of how to convert a Regular Expression to its equivalent Finite Automata

Music:
Axol x Alex Skrindo - You [NCS Release]

[AGV_Prints]

This channel saved so many lives including mine who else with me !?👀 🙌🏻❤️

[abdulshaikh]

this guy is truly a just some 6hrs left for the exam now and I've covered the Conversion of regular expression to F.A and vice-versa just playlist is just damnnn supportive for students like us who sits just one day before Neso B.Sc student;

[lator]

Such an elegant and easily understandable explanation.
Thou art a life saver.

[Unknowing]

The best teaching method i have come across. Thanks a lot!

[Shanmukha]

Mind blowing explanation sir.
The way your teaching is awesome <3.

[shohineemandal]

I love this channel .. too good explanation of all subjects..

[papilondon]

very nice lecture. your explanations are amazing

[turrinaga]

very good and easy to understand..Please make these videos quickly so that I can cover TOC in this sem.

[luzeniltonjr.]

Can i eliminate the ‘D’ state by putting 1 in transition of ‘B’ state directly to ‘E’ state?

[-exe]

Thank you so much!!! So easy to understand!!

[leviuzodike]

Can we eliminate D and add an edge from B to E on input 1?

[adelalnafea]

Professor thank you . Now realy i understood this chapter..
I have a question: Q) can we make here 2 final state ?

[lator]

In the case that a state has a Kleene operator on an expression, how does one break it down?
If we had (01)* how would you break it down?

[yogeshkumar-lrkt]

i think this can be done using 4 states also

[sillah]

Can you now upload more example of regular expression of F.A

[omarmohamedali]

Your channel is very interesting ...
What is the DFA from (ab)* + (a+b) (ba)*

[gursimransingh]

Can we make a Final state 'F' from E, instead of making 'C' as final state from 'E' to 'C'?

[ashasonale-xu]

Construct finite automata for the regular expression 0*+1*+2* ?

[devendragonde]

from state A, transition for 1 goes to b and also to d . So can this be a nfa?

[GlimpsOfWebSeries]

how can we calculate the number of final In the previous lecture it was two final states then why can't be in this example??