Deterministic Finite Automata (Example 1)
Vložit
- čas přidán 16. 12. 2016
- 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'.
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.org/donate
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy.org/recommende...
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
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
man CZcams is such an unfortunate media, i can only give one thumbs Up, amazing tutorial, thank you!!
I will give him one more on your behalf!
Donation link in description :)
You can donate money if you want to, link is in the description
Well, If you want you can donate at www.nesoacademy.org/donate
3 years ago...
Hope youtube gives you a lot of money. Pure Legend
Just started my Theory of computing class on Tuesday and I'm glad you made these! thank you!💙
why we should take only 0 and 1 as inputs?
Honestly this is the first video I've watched from your channel, but you saved my day. I love you so much
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
neso academy always saves the day!
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.
Dhd
What is the name?
sir I cnt explain how much have you done by these videos...you are amazing..keep doing good work sir
This guy explained much more information than my professor. lol.
thanks for this, you've gained another subscriber
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
Always some unique, logical and dedication type method.
all academic areas must understand this.
Thank you so much! Greetings from Argentina!
What goes to state C, stays in state C.
You can check out anytime you like but you can never leave.
@@ritiksrivastava3093 Welcome to the hotel "C"alifornia
My callertune tho....
1
Any string starts with '1'
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 ?
Thank you so much, man, you're really helping me out!
The way he explains is the best
Idu the final state!!
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.
Amazing explanation
Everyone Lecture You Explained Well.......Thanks a Lot Sir
Thanks!
Very good explanation ...such an ideal tutorial ...
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!
Wonderful refresher, many thanks
Wow...Thanks! You make it simple and easy to understand.
I freaken love you and this channel for this content!
Superb the examples are amazing
Thanks for making the video
Amazing tutorial sir. thank you!!
Nice explanation with verifying that constructed DFA 👌
Excellent teaching process
Sir you are providing us the great help.....Thank you so much.....May god bless u
Keep teaching & sharing......
Very well explained. Thank you!
Great explanation thank u today i have presentation on finite automata and ity types this is helpful
Excellent work
What an explanation ✌️
Literally hats off to you. .may god bless you man!
yeah
Great explanation..
amazing videos, thank you very much sir
Good explanation sir
Thank you bro,I understand well ,superb teaching
Thank you thank you thank you thank you x1000! Helped me understand it so much better.
thank you bro actually prepared me for my test the day before
Well explained
Thank you so much ❤️
Amazing! thank you
awesome video. keep up the good work.
Sir you are grate .....yore hope of many many students
Thank you so much, this helped me so much!!
Our teacher sucked at explaining these , finally I found something. Thanks
You help us to move on bright path thanks you so much❤
LOVE IT! THANK YOU!
I love the outro music
I owe my flat grades to you! Thank you for explaining so wonderfully
I dont mean to be so off topic but does any of you know a trick to log back into an Instagram account??
I stupidly forgot my login password. I love any tips you can offer me.
@Darwin Adriel instablaster :)
@@elishavincenzo1833 This is a bot and a scam.
@@lucy-h Elisha is also a bot
@@pranav288 Yep, pretty sad really
Excellent video
wow, you made it look so easy
It helped a lot thank you sir
Hat's off to you sir!
Thanks
Hi, it's me, the new generation. learning automata theory as well!
thanks broo, you saved my day
its easy to understand sir thank u sir
Perfect explaination tq neso
Thank you so much for this!
Very nice lecture
hats off 👏👏you peoples are rally rocking 😍thanks a lot😇
❤Well explained.. Thank you very much..😊🔥🔥🔥👍
very; nice explanation
Thank you❤
thank you very much
Thank you so much!!!!!!!!!!!!!!!
Thank you
great help
Out of all the other video lecturers from channel such as tutorials point , education 4u,Khan academy, etc.. neso academy is the best study channel that I have ever seen thanx a lot ..mannn..great work keep going..
Thank You
You’re a literal god thank you so much
Thank you ❤
Sir why can't we place the self loop in A state for input 1 instead of considering another state C. If input would be 1 then it would remain in A or if 0 then it will go to final state.
i really want to know why
same Question
Because it will accept inputs that start with 1. Picture this, for example, the input is 100:
Input 1: Stays in state A
Input 0: Goes to state B
Input 0: Stays in state B
The string is then accepted even if it did not start with 0.
But using a separate state C:
Input 1: Goes to state C
Input 0: Stays in state C
Input 0: Stays in state C
The string is then not accepted as it was deadlocked in state C.
Thanx
best .....nothing to say easy explanation
*Excellent*
thank u very much sir
The way you fluent English is really fabulous...
yeah....
@@sahithi_sribhashyam your teaching skills are good, keep going
Your grammar is horrible though....
@@gigachad6844 what do you mean bro ?
thanks you sir
Amazing keep it up 😍😍👍👍
Thankyou so much
it is really good
cool thx !!! simple enough
thank you so muchhhh
Thank you.I am happy 😊
Hii Sindhu ❤
can you explain this sum design a dfa for set of string over (a,b) in which there are atleast two occurance of b between any two occurance of a
Thankyou sir
U r great sr...thank u so mch
thanks sir
Thanks 👍 , from republic of Yemen 🇾🇪🇾🇪🇾🇪
Thank u so much
sir can we create a self loop for input 1 on state A??
How about ends with 001 for example: 1001, 101001, and 001 are accepter while the strings 1000, 10011, and 0010 are rejected.
we dont care about any 1 except at first position
Ty
Wowww! Awesomee!!!
Sir is it is possible to have a DFA where there is two transition function {a,b} but there is one state (A) from which if we are taking {a} we reach to some state (say (B)) but on taking {b} we are not reaching any state .
Is it ok to put a self loop on A when the input is 1 ?