Deterministic Finite Automata (Example 2)

preview_player
Показать описание
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.

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

#TheoryOfComputation #TOCByNeso #DeterministicFiniteAutomata #DFA #AutomataTheory
Рекомендации по теме
Комментарии
Автор

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

SD-ptnu
Автор

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

MohsinAkbar.
Автор

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.

shaylinpadayachee
Автор

This is too easy... I'm suspicious...

gabrielsales
Автор

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

adityapal
Автор

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

MohdAslam-yzkw
Автор

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!!

kanekiken
Автор

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

ashritavarma
Автор

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?

ameykulkarni
Автор

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

MikaelTesfaye-tqhe
Автор

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..❤

hoi
Автор

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

sumitjaiswal
Автор

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

harshlondhekar
Автор

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

mustafa_sakalli
Автор

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

iqbalahmad
Автор

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

imhsk
Автор

damn, the question is so poorly worded... no way i would ever figure out what that would mean in a exam

shitcunt
Автор

What's the point of studying this subject ?

pinin
Автор

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...

jey
Автор

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

anandababu