Non-Deterministic Finite Automata (Solved Example 1)

preview_player
Показать описание
TOC: NFA solved problem 1.
Topics discussed:
An example showing the behavior of NFA and showing in what conditions does an NFA accept or reject.

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

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

Binge watching for my upcoming test. 🙃

selbymncube
Автор

Neso Academy is best. He doesn't waste time in advertising, bragging or unnecessarily randomly speaking anything in between lectures like other so called teachers. He has organized and structured syllabus so well so that not even single minute is wasted and choosing best way possible to explain in simplest manner that's what a teacher is supposed to help us with that's what makes him different from many so called money minded teachers.

muskan
Автор

Hello sir.
I don't know if you have even read this comment or not but I have to convey to you that all your video lectures are too good sir.
Whatever maybe the likes or subscribers or views do not let it affect your video content. Please carry on your great work.
You are a good teacher indeed.

rohifernandes
Автор

Your teaching is very easy to understand.i have to admit that you teach a lot better then the teachers of my college.

tapanmahata
Автор

I am seeing these videos coz tomorrows my exam . and I have to admit u teach way better than the people at my college

fatimanaseeb
Автор

This is so much better than my tenured professor its ridiculous. Watching his lectures it's like trying to discuss alien quantum chaos political theory to save the earth, and watching this is just watching a good teacher actually teach theory of comp

sardonic
Автор

This is the most underrated channel who deserve more attention and views

bibekanandroutray
Автор

Best Automata videos. Please keep posting videos. Can you post lectures on Analysis of Algorithms? You are amazing!!!!

Gcharms
Автор

Best Automata series ever. Thank you so much

LearnwithMinti
Автор

at the end of input if you are going no where that means you are in same state which is B(6:00) in this case.

shubhamkadu
Автор

Thank u, Neso, for being a great man!! I'm learning with u

tiagoamarilha
Автор

Thank you! Your explanation is very easy to understand.

zumitrim
Автор

If input is just 0...it actually can go to A itself...then howcome its valid as it hasn't reached the final state??

Smile-sixv
Автор

my teacher plays your videos in lectures

shinigamiryuk
Автор

why do in DFA you call a state in which there is no way to get out of a dead state, while in NFA you call them phi?

baralul
Автор

So an NFA accepts the correct input sometimes and never the incorrect input? But why? What’s the point of making it incorrect sometimes

TumblinWeeds
Автор

Very helpful and academic tutorial, Thank you

bushrhaddad
Автор

Excellent explanation. Thank you, Sir❤

shrikantjoshi
Автор

Am a bit confused .I haven't worked out the difference yet.The method is similar to DFA ENLIGHTEN ME.Could it be the phi mention and illustration be the ones that differentiates?

piazapetit
Автор

Hi. Can you please write the comment for how you draw the transition diagram for above example ?

Prof.AshwiniGharde