Conversion of NFA to DFA (Example 3)

TOC: Problem Number 3 on Conversion of Non-deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA).
Topics discussed:
This lecture shows how to convert a given NFA that accepts all strings over (0,1) that end with '01' to its equivalent DFA using the Subset Construction method.

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

#TheoryOfComputation #TOCByNeso #NFAtoDFA #NFA #DFA #AutomataTheory

[mogomo]

It, s really impressive the way you explain all. I, m from Spain, and I prefer your lessons rather than any other (please, excuse my bad English).You are simple, direct to the point, clear and use a lot of examples.
Congratulations, Universities around the world need a lot of people like you.

[somethingcoool]

Hell, you explain the concept better than the significant majority of uni professors.

[shirshakk-p]

Damn Man, you brought my interest back to this subject.

I lost it from the first class at my univ.

OP Man🔥🔥🔥

[GIT_Somya]

When sir teaches so well, I make the DFA before him!! tysm!

[psykjavier]

who those that was wondering what it is good for, i have used in the field of automation in a sequential circuit that it has the main goal to carry out any automation control, suppose that you are controlling a process like a robotic arm that needs to make a specific sequential routine in which the current output depending of the inputs as well as the current state. it can be implemented using flip flops or can be designed using a hardware description language like VHDL or verilog or even in a microcontroller, thats why i am studing this topic by myself. the main idea of all this knowledge will be apply in the programming of a PLC.

[WizardNight]

for those who confused why we dont calculate C state and tanstion it into Dead state, statae C is not reachable whith any state in DFA transition table. so why we should calulate the transition of state C when we have nothing to do with it

[somilmehta]

Sir why did'nt considered C also as a final state? In the previous example we considered C also a final state..

[muthukrishnanvignesh]

In NFA, example 3, L4 ={all strings containing "01"}
There, if from B, if '0' comes, then it can stay in B. Why didn't you mention that?

[kshitijsrivastava]

Why didnt you, mentioned state B, C?Earlier video you have.Please clear !

[peddakotlasravan]

Excellent lecturing sir....
Thankyou very very much

[ishitachatterjee]

Sir b, c and d is ignored in this problem. But if a or b state would b related to them or trap then what would be done?

[carefulpath]

Thank you Sir! I finally understood this concept at the end of the semester. I wish I got your videos earlier. Thank you again!

[ajaykarthik]

thankyou so much please complete the COMPILER DESIGN tutorial and DBMS as soon as possible

[the_ghost_of_uchiha]

sir while constructing the NFA why didn't you give a self loop to b for taking input 0.There should be a self loop, i think.

[prashanthi]

the answer to that last question is
the strings that contain only input b with odd number or strings that contain both a, b inputs with ending oddnumber of b's

[guestproperty]

Is 0 can be given as input from B and loop it there?

[shoaibali]

Thanks a lot sir for sharing valuable knowledge.

[AyanKhan-feqc]

Sir in first NFA 'b' should also have a self loop for 0 i think
bcoz for example take a string 10001 acc to video it will be
a->1->a->0->b->0->phi but this is valid string

[Tarun]

why b and c were not included in the transition diagram @Neso Academy

[Ogg_skimmer]

I have discovered a technique that work more times, when ever the question has something like 'starts, the initial state cannot maintain itself so it starts moving to other states. the vice versa that's when the question has something like 'ends with', then then the final states too cannot be maintain in itself.