Deterministic Finite Automata (Example 2)

TOC: An Example of DFA which accepts all strings over {0,1} of length 2. This lecture shows how to construct a DFA that accepts all binary strings of length 2 and rejects everything else.
Full Course on TOC: goo.gl/f4CmJw
Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
Follow me on Instagram: @jaiz_itech (bit.ly/2M3xyOa)
Contribute: www.nesoacademy...
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy...
Website ► www.nesoacademy...
Forum ► forum.nesoacad...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#TheoryOfComputation #TOCByNeso #DeterministicFiniteAutomata #DFA #AutomataTheory

[@kanekiken12376]

one ofmy university teacher was watching the TOC lectures by NESO academy. she could solve the questions butfailed to explain us the same topics she studied a while ago. I mean,the conditions of a few college teachers is really bad, and pathetic. thank you Neso academy for saving the lives of thousands of students. Mad respect for the neso academy teachers!!

[@Fracasse-0x13]

wouldn't fly in america

[@MohdAslam-yz5kw]

These video lectures is great when you really don't know where to start with. Explanation of the guy is amazing.

[@shaylinpadayachee7766]

I appreciate the simplicity and explanation of small things, I only wish the institute which I pay dearly for would try such an approach instead of just being smug and saying how smart they are while not teaching us.

[@shumailasaifi]

lol

[@shadowslayer2248]

Literally commented the words in the minds of everyone who came to Neso Academy YT channel as a last ray of hope.

[@adityapal5817]

Thank you so much. I have exam tomorrow and i skipped lectures. You are amazing ❤

[@maar2001]

So how was the exam?

[@hoi5771]

I can't compare this class with my teacher...Because they teaching the whole thing in a pure disaster manner.. Your class is precious to me..❤

[@sumitjaiswal855]

Finally I have started to understand automata.. Thank u sir

[@MohsinAkbar.]

But why we can't take a self looo on state C, as we complete the length 2 of the string?

[@frazebean5117]

You cannot self loop at C because it would be contradictory. C is the final state but looping again means you add another symbol, which would exceed the required length of 2. When you exceed that required length it means it would be invalid, which would not be possible as C is the final state. (Final state cannot be invalid).

[@SD-pt1nu]

Why these videos keep explaining so amazing while our teacher is teaching like sh*t?? 😃😃😍

[@uiuxshoaib]

Asking myself the same question.

[@siddardhagunturi8111]

Here we are going to listen before exam in class we listen with a sleepy mood

[@isaacazameti6661]

I am surprised

[@siddharths5135]

Exactly

[@zainwasem]

Because you are paying to your teacher.

[@AncientInsights1]

Even though I have not entered the class for this I now hv a good knowledge of this.

[@10subsonlychallenge66]

I understood the concept very clearly thanks to you man

[@jesusdanielmartinezgarcia2445]

Thanks man

[@tamzidchowdhury472]

How can people dislike this video?!

[@gamar1226]

Those are college teachers, lol

[@ranitbarman6471]

@@gamar1226 lmao 🤣

[@ajaygurung4916]

loved how you explained it in such simple way

[@ajaygurung4916]

easy to take in

[@hossamahmed5360]

well, Thanks so much sir for your efforts .. simple, direct and easy to deliver the idea of the question and how to solve it..

[@AGGUNNADHARMARAO]

Your way of explanation is so good sir

[@iqbalahmad3754]

Very good explanation, I really appreciate that :) Thanks for making this videos :)

[@yasina63]

Fantastic, very useful. Thank you so much. I have a mid-exam in the afternoon. Your teaching style is a piece of cake.

[@kirteekumari3459]

you're a great teacher, thank you so much for this !

[@mustafa_sakalli]

Why we've drawn D ? If we let this after C, it will also satisfy question?

[@anushapodugu1683]

Thanks bro I am searching for this ....

[@HafsaBinteHamidShuhita]

Thank you sir. You are teaching us in very nice way. Thank you so much.

[@strz3086]

Really helpful man, been to so many lectures and can never understand but your videos are much more helpful in understanding. Thanks

[@vijaykrishna6317]

Instead of dead state can we give self loop to state c ??

[@secretlyglowing]

did you learn the answer??

[@ameykulkarni1742]

5:200 In the last video you mentioned that for completion of DFA for each state we have to give some input... Suppose here in this example is it necessary to give= A takes input ->0,1 & goes to A, same for state B, then & only then it's complete DFA?

[@marco.nascimento]

Awesome videos, loving the playlist

[@debangshubhattacharjee7062]

finally understood automata ,thank you very much🙇‍♀🙇‍♀🙇‍♀🙇‍♀

[@AlAmin-sl8eg]

10000000 times better than my course teacher.

[@ChoppinThemUp]

thank you so much completely upset how I found your channel after my exam --;

[@MikaelTesfaye-tq7he]

At the first example why didn't we loop 0,1 at the final state C instead of going to the dead state

[@ashritavarma132]

Can we put a self loop for b containg 0,1 and mention it as final state?

[@harshkumar7857]

Can we? Have you found out?

[@adityaralhan1154]

@@harshkumar7857 .

[@kainpaul5839]

What if we eliminate D and put the loop at State C?

[@rajatbose8844]

the purpose is to eliminate any strings above two to dead state so a self loop on c would not send it to dead state but to final state meaning the you want any 10 combination of infinite length

[@samika1983]

Prime minister Modi is going to call you out Keep up the good work.

[@kannuagrawal2127]

Thanku for making this amazing videos on automata. It's help me a lot. Initially I have little bit confused from where it can study automata I have even buy so much books but nothing get help but as I have seen this tutorial it can get help me a lot thanks 🙏🙏

[@maddiralasaiharshith]

very impressive,explanation is so clear this videos are so useful at exam point of view thanks !!

[@alphacoder3822]

sir im not even kidding i will bow down to your feet and do a namskar with my head. you are a legendar teacher sir. i had failed in this TOC twice sir, everytime i asked i profesor for notes or how to study this subject they always told that study from the reference book but you know that the reference book as scary as a real ghost. i think i found neso acamedy a little late but anyways finaly i found it and im understanding concepts crystal clear. shat shat naman hai guruji aapko.

[@andyanderson222]

Thanks a lot, man! Great examples and great explanation!

[@ajaykarthik01]

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

[@pradeepthidiyyala1219]

Why can't we give self loop to c?

[@hectorg362]

I freaken love you and this channel for this content!

[@liveehivy]

May you live a long prosperous life!

[@danhibiki110]

Wow you really helped me understand it better> Thank you very much.

[@id-19-farhadhossain78]

sir love you and appreciate all your efforts,,,best wishes from bangladesh

[@harshlondhekar7656]

I skipped the wix ad just at the moment when he told wait before skipping ad . 😂😂😂😂😂

[@imhsk1037]

why can't "c" having self loop sir. pls clarify my doubt sir pls🙏

[@geolegacy2]

If it C has a self loop an input of 3 alphabets will be accepted because the third input would end at C and C is an accept state. He extended the diagram to have a 4th state D so as that the third input can end in a dead state(D), understood?

[@kickbuttowsk2i]

@@geolegacy2 yep dude

[@jaisonjohnson460]

@@geolegacy2 Thank You

[@swatimandal6014]

@Sunaan S we can't make a self loop on B. Beacause in case of third input or many next inputs, it will accept which is not possible

[@MILDTALK]

It also violates the rule of having length 2, if C contains self loop.

[@kaushalbandara2667]

❤Well explained.. Thank you very much..😊🔥🔥🔥👍

[@aishwarya1895]

You are a great teacher ✌️

[@fahimafahima7290]

Sir your teaching is really good

[@kenneth5912]

so if the question wasn't limited to the length of 2, we would have made "A" self loop with 0,1 right ?

[@nivethars6520]

Really good explanation

[@anandababu9223]

I have a doubt sir is it necessary to have 3 states or we can use self loop for B state

[@BeatCStechnicals]

Ya same doubt

[@thusharkulal6695]

Bro in question they have mentioned length as 2. So it is necessary to have 3 states

[@Nextgame999]

If you give self loop on b so it create 1 length as well as 2 length. We we want exactly 2 length string.

[@TariqueGauri]

Sir also provide practice questions with solutions or just answer if possible. Thank you so much 🖋️📖📚📚📚

[@0pini0n21]

What's the point of studying this subject ?

[@MMNayem-dq4kd]

Thanks for the effort

[@rajarshibasak559]

really, fantastic and dynamic videos.very helpful

[@tajaladar9569]

awsome way of teaching.........

[@Ashimiim]

Sir please tell how to know how many states we will get? How to check if the drawn diagram is correct?

[@abinaya3324]

To know whether the diagram is correct or not only he is checking with the string at the end

[@AhamedKabeer-wn1jb]

Good Explantion..Sir...Thanks..

[@abdus_samad890]

I have one question sir...why 0,1 is taken as input after reaching state B.is it depends on the length of the string?

[@Farahat1234]

Me too😔

[@كوكتيلسعودي-ج2و]

Thank u man this was so helpful

[@youtuberkid1623]

Is it necessary to draw dead state to every DFA?

[@annudeshmukh]

Yes, if dead state isn't present your machine would simply truncate the remaining inputs . For eg: if the input is 000 or 001( these are strings of length 3 ,and hence should be rejected by the machine, but if the dfa doesn't have a dead end every input would simply stay in the final state at the end thereby accepting all string values and our designed dfa will be wrong ) . I just hope you understand whatever I tried to explain.

[@Aman_Yadavvvvv]

Thank you

[@lizatheangrycat]

during your last example there is string of length 1 which is not a final state so tell me why it isnt a dead state.

[@jey8605]

I thought a finite automaton is only deterministic when the transition from one state and another contains only one symbol... you went from A to B with both 0 and 1 on the same transition. This makes this NOT A DFA...

[@sunidhibidarahalli]

it is not '0 and 1' it is '0or 1'. see carefully , you are taking any one input(either 0 or 1) at a time. since the input at a time is deterministic it is a DFA

[@abhinavsohal5317]

why you have not put self loop in state c please reply asap tomorrow is my exam

[@luke8983]

Hi I know this is late but for anyone else wondering. If you put a self loop on state C the string 001 would end on state C, which is the final state. This means it would be accepted. We need to ensure an invalid string ends in a dead state so that it is not accepted.

[@natsudragneel8305]

@@luke8983 Thank you so much

[@lekshmiaji7819]

@Luke Nolan but our question was to accept strings of length then how it is possible to accept a string of length 3 or more

[@lekshmiaji7819]

I would get the reply after 3 months😂😂

[@DilpreetKaur-zt5eo]

why we make state D we can again come back to state C for any input 0 or 1

[@bhagwatdhavale6091]

Excellent explanation 👌💐

[@srijonsinha3325]

To NESO Academy Why can't the self loop be implemented in state C itself rather extending it to state D and then implementing a self loop and making it a length of 3. If self loop is implemented in state C itself it stays in state C wether or not its '0' or '1'. As done in the previous lecture DFA (Example 1)

[@muhasibHafeez]

if we apply self loop on the state C only it will accept strings of longer lengths like(00000011111) which we dont want to do, we only want to make accept strings having length 2

[@bautistabaiocchi-lora1339]

really clear examples

[@cmrdecc6516]

Thanks a trillion kind sir

[@bunnybro1902]

You are life saver DUDe

[@v1rtuosa]

Thank you so much sir

[@yeshalashravani8722]

What if I give a self loop to B??

[@bmwmaniac3]

If you give a self loop to B you are allowing inputs greater than length 2 so we need 2 states A and B and a final state C

[@aadarshmishra1488]

Then it occurred 1 length

[@leroypalmer9226]

@@aadarshmishra1488 i agree that we should go back to state b with a lenght of one on any input at the final state

[@jhulandutta1848]

@@bmwmaniac3 c is not final state

[@agamgill9563]

Explaination is realy good....

[@govindaupadhya8623]

what happens if the string passed is just 1 or 0

[@codek2.065]

Sir you are amazing!..plzz make videos on python,compiler design,design and analysis of algorithm sir✨✨

[@epicclips8881]

Nice lecture

[@EasyExamNotes]

Excellent 👍

[@thanujiths5677]

It was very much useful

[@kmeet895]

Thnkyou for the explnation

[@kainaatmakhani6550]

good lecture

[@harisaipolishetty7869]

why can't we put A to B (0,1) then from B to B self loop(0,1)?

[@secretlyglowing]

did you learn the answer??

[@prasanna996]

length 2 is mentioned in question so that's why we taken

[@jeremiegavin5286]

what happen if there's no input ? like ebsilon.

[@lohithnnegalur2018]

1000x better than my lecturer

[@gauravjaiswal3673]

sir in these example if we give no input then also it goes to an different trap state

[@eva42sh]

Thank you so muc

[@abhishekshrivastav6193]

is there any way to run video on higher than 2X.

[@sattamkh]

Is it necessary to write dead state? why he does not stop at the final state? I think this is enough as a solution to the issue

[@ashiskumarnayak9122]

Yes I have also doubt in this can anyone please tell me@ Neso academy

[@rinapatil5639]

Why did we take 4 states ? In this DFA

[@nerinpeter8387]

Please help me.. I have doubt is DFA contain only one input where NFA contain two or more that's a difference between them.. Then how is this they use two inputs?

[@alibulus4382]

thank you very much

[@SmartCam13]

Thanks

[@alpergok9795]

Sir,forgive me but in DFA Rule 1:For each state in the DFA, there must be exactly one transition defined for each symbol in the alphabet So:How 0,1 going to same state ? There is an undeterministic situation here i think ? However thanks for your clear explanation.

[@michaelekoka3263]

> For each state in the DFA, there must be exactly one transition defined for each symbol in the alphabet There was exactly one transition defined for each symbol. There was a transition defined for symbol 0, it goes from A to B. Then there was a separate transition defined for symbol 1, it goes from A to B. Transitions for both symbols go to the same state. He could've used two arrows, one on top going from A to B and labeled 0 and another one at the bottom also going from A to B and labeled 1. Instead he reused the same arrow and simply labeled it 0,1 to mark that they're in fact two separate transitions.

[@warangproduction9759]

can't we make state B as the final state and loop 0,1 in B????

[@isaacazameti6661]

thank u sir! But is your solution the only right answer? or there are other possible DFA for this same questions.

[@apporvaarya]

thanks for teaching so goooood...

[@dimmortals67]

why didnt give a self state to state C why state D

[@LakshmiDevi-jn2dw]

Sir can u do construct a dfa that accepts 0 and 1's that has even no of 0's and even no of 1's

[@natsudragneel8305]

wonderful explanation. Thank you so much. But i am having one doubt that why you have not put self loop to state C. In first example of DFA construction as the state ended at B you given self loop then why not in C in example 2

[@ΙωαννεςΦαασεν]

Because state C is a final state and a string larger than 2 should not be accepted. A self loop in C would mean that strings larger than 2 would become accepted by the automaton.

[@natsudragneel8305]

Thank-you so much sir

[@shishirsomapur9980]

Sir, here we can also put a self loop to state b and make that only as final state right?

[@austineobi4081]

Why didn't it end in (C) I.e the final state ?

[@watchme1689]

I dint understand one thing !! Is it compulsory to mention Dead state for all DFA problems ... my teacher he dint gave dead state for some problems ... is it optional ..or its mistake if we dont mention it ..

[@niveditachaudhari07]

is this lectures enough for gate prep'