Non-Deterministic Finite Automata

TOC: Non-deterministic Finite Automata
Topics Discussed:
1. Properties of Deterministic Finite Automata (DFA).
2. Properties of Non-Deterministic Finite Automata (NFA).
3. Difference between Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA).

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

#TheoryOfComputation #TOCByNeso #NFA #NonDeterministicFiniteAutomata #AutomataTheory

[cgr]

Thank you for this whole playlist on TOC & Automata!

[mrboyban]

Paying a ridiculous amount of money for a "reputable UK university" while I have to watching this life save videos on YouTube in order to keep the struggle alive. This man deserves the tuition fee really! When would this be implemented? Youtube Bsc certification?

[GABRIELGREGORI]

I was watching multiple videos and tried to learn from other channels, I felt like I was stupid, but after I came here at the first 2 minutes I realized the big picture and saw how easy is this, this means how much your channel is special, making things simple. Thanks.

[Luna-fuix]

Sir your videos are like Magic..i dont know how should i thank you.

[NightlyShadow]

I had so much trouble differentiating between DFA and NFA. Thank you so much!

[ginicholas]

Wow your english is pretty damn good, normally I have a hard time understanding the english pronunciations from the many different native countries that teach Computer Science but yours is pretty good and not boring or mono-tone at all which makes it very easy to listen to. The software you use to teach is also top notch, thank you my good sir!

[jasonr]

I love the way you explain this subject. Thanks for making these videos and educating the masses!

[geekybench]

My lecturer spent 2 days trying to explain this concept to us and here is Neso Academy with a 6 minute video.

[abhilashadeshwar]

Very use full lectures .
I m Assistant professor in college n very helpful for me

[bplusstudios]

Can you make a video on Neir: Automata?

[devmahad]

The summary of the video is, that the difference between deterministic finite automaton and the non deterministic finite automaton. So in deterministic automaton, there is a unique next state which has no choice of randomness and is simple and easy to design. They are multiple next states which can be achieved using or consuming one input or no input in that case, in that case it is called that input epsilon. So that's a brief overview and differentiation between deterministic finite automaton and non deterministic finite automaton.

[TheSkulldraw]

Thank a lot this playlist is amazing ! great work. thank you for the time you took for this!

[liveehivy]

You are the best person in the entire world. I salute you sir.

[ashaliaar]

I watched several videos of toc from different channels... but i understand nothing.., .God showed me this channel and now I understand easily....i just wasted my time watching other channels.... thank you so much sir. Can you provide all videos according to the syllabus of UGC net

[katepallivineeth]

Sir why u use only that type of diagram? I didn't understand that type diagram

[adachi]

even as a Chinese that is not a native English speaker, I can also understand it very clearly. best lesson ever, thx!

[prashantkaushal]

lectures on push down automata and turing machines are not availabe

[jayasree]

Don't dislike the videos this videos were better than all other videos
Nd I'm Tq for a excellent expalination of videos

[reu]

thank you i love you so much, your explain so good

[fktnqtf]

Thank you for excellent educational material. I have one question regarding this video: Shouldn't the first statement be modified from "In DFA, given the current state we know what the next state will be." to ""In DFA, given the current state AND A GIVEN INPUT we know what the next state will be." ? Similarly I believe that the second statement should read as "Given a particular state and a given input, It has only one unique next state." Please confirm my understandig or correct me if I am wrong. Thanks in advance,