Deterministic Finite Automata (Example 1)

preview_player
Показать описание
TOC: An Example of DFA which accepts all strings that starts with '0'. This lecture shows how to construct a DFA that accepts all binary strings that start with '0' and rejects all that does not start with '0'.

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

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

After 9 years since I started CSE course, today I understood the basics of TOC

johnnysaikia
Автор

Was contemplating on creating a Compiler for my little language, this series of tutorials helped me a lot. So simplified are the explanations, more understandable than text explanations. Please keep up the good work.

felixshava
Автор

Just started my Theory of computing class on Tuesday and I'm glad you made these! thank you!💙

Lande
Автор

Excelent!
Thanks a lot from Brazil.
I had difficulties when I studied this subject at college but after watching your classes I am a little more confident.

gabrielpereiramendes
Автор

man YouTube is such an unfortunate media, i can only give one thumbs Up, amazing tutorial, thank you!!

shubhamtrivedi
Автор

sir I cnt explain how much have you done by these videos...you are amazing..keep doing good work sir

harshupadhyaya
Автор

My faculty took 2 weeks to explain that with lots of examples and all that stuff I was bored asf and didn't understand anything its his teaching style not suit me but this 10 mins video❤ learning is fun

DasCODE
Автор

Hope youtube gives you a lot of money. Pure Legend

champ
Автор

Honestly this is the first video I've watched from your channel, but you saved my day. I love you so much

marcox
Автор

I had FAFL when I studied my engineering. For some reason, I couldnt master the subject to the extent what i intended. 15 years gone by and I decided to refresh the basic of computer science starting with FAFL and Discrete Math.
Loving watching this series as it is bringing back a lot of memories along with better understanding of basic CS.

Are there any notes that I can download [as in just the images that you have drawn] in a PDF format perhaps ?

rahulkamath
Автор

I wish I had found you 4 years ago. My life would be a lot better now. If it should still turn around because of your videos, if I should continue with my Masters, I will give a big thanks

shavkat
Автор

Always some unique, logical and dedication type method.
all academic areas must understand this.

sukantsingh
Автор

Thank you so much! Greetings from Argentina!

estebanrivas_
Автор

Trying to build a DFA was kicking my butt, but after seeing your video I know what I need to do. Thank you so much!

jeremiahmort
Автор

I almost give up to my course, because of the subject automata. I thought it's very complex, the way you explained it is very easy to understand.

lomeriojohnmark
Автор

This guy explained much more information than my professor. lol.
thanks for this, you've gained another subscriber <3

kennethJAO
Автор

What goes to state C, stays in state C.

akashsaxena
Автор

What an explanation ✌️
Literally hats off to you. .may god bless you man!

aishwarya
Автор

The way you fluent English is really fabulous...

ravindrathalari
Автор

I owe my flat grades to you! Thank you for explaining so wonderfully

vaishnavi