From your video on DFAs of various types (substring, string ends with, string start with), I came to understand why we construct the transition table they way we do. It is a tricky problem, you explained it well! You are the best!
thank you so much bro...the video was really helpful...i tried understanding the concept from most acclaimed youtube channels for toc but yours was the best..more power to you brother keep the good work going
Great video first of all, absolutely easy to understand. What if we have to design a dfa which accepts only "aa" substring? is it the same way you have solved for the above problem?
pls continue further topics.like.NFA construction..etc.. .ur videos r really AWESOME..we have semister exams ur videos r very usefull fr us..pls do more videos
Very helpful and cleared my concept upto very much extent..Great work.. Hope so that you guyz put up a video for how to draw DFA from regular expression
Bro....just awesome🤘why don't my teacher teach me such a simple way🤷awesome bro .... Can you please upload video that string ends with ab and ba as well
Hello guys , thanks a lot for these easy solution , I came across a problem that says , "design a dfa for set of all strings with atlest one a and two b's. How do you solve this ???
Why here you cant written the reject state but you mention the reject state in string video...because of this i am confused where i have to mention reject state or not. Please answer.
i haven't checked out your channel for other videos yet, i just came upon this playlist explaining DFA. Can you do NFA, Mealy, Moore, Turing Machines too?
q1)(DFA)automaton being contains neither the substring ab nor ba ?? can you please make a video on this types and also q2)string starts with 01 and ends with 01
From your video on DFAs of various types (substring, string ends with, string start with), I came to understand why we construct the transition table they way we do. It is a tricky problem, you explained it well! You are the best!
freaking genius !, no one explained it the way you did, you absolutely make this look easy, you are amazing !
Clear and simple. This is exactly what I wanted. Thank you.
I have my FLAT exam tomorrow and this video really helped me a lot. Thank you
Pass?
thank you so much bro...the video was really helpful...i tried understanding the concept from most acclaimed youtube channels for toc but yours was the best..more power to you brother keep the good work going
Thanks a lot Sir.... before that we are not able to understand create DFA of substring... You explained it in most simple way.. Thnksss.....
you make wonderful videos you should have done one the starts with and ends with certain alphabets as well
How to construct a dfa starting with ab and ends with ba
yup sir how
Must say this is an awesome video which helped me as a quick revision before going of my exams thnx a lot grt work and keep going 😊💐👍
Best best brooo. You made things easier I came to understand your toc 4 videos and types of problems also so easy .. Thank you
hey bro...plz make videos of the NFA and conversion of NFA TO DFA vice bersa....i need it plzz bro😣
ya am also need the same witha the Four elements not with three
yeah me tooooo
Super Super Helpful. Learnt methods that i never knew before. Simple methods at that.
The videos are damn helpful :) If y'all could have videos covering NFA as well it would be amazing. Thanks
you guys are saviours😊 thnxx a tonn for sharing this video....keep up the good work😍👌
+madhuri motwani
Thank you :)
Ay fam, you a real g for sure man! my fuckin guy on a real one. broski just saved me from failing an entire subject in my course. Love g
Great video first of all, absolutely easy to understand.
What if we have to design a dfa which accepts only "aa" substring?
is it the same way you have solved for the above problem?
pls continue further topics.like.NFA construction..etc.. .ur videos r really AWESOME..we have semister exams ur videos r very usefull fr us..pls do more videos
Mila kya tere ko aise Technic ke sath
Good Technique. Very good for starters.
Keep it up
Very helpful and cleared my concept upto very much extent..Great work.. Hope so that you guyz put up a video for how to draw DFA from regular expression
+Aayush Patel
Thank you :)
Will try to upload as soon as possible :)
Excellent 👌 be CONTINUE bhai
thanx a lot😊 .can u upload video designing dfa even odd
Nice work guys! Thankyou a lot for the concepts.
This was super helpful for my homework problems. Thanks!!
just as u said excellent technique it is really an excellent technique ...very helpful thanks alot!....keep making videos )
grt work done by u guys.... thanq so much for awaking new hope in me ..........
great video.... we are waiting for more videos like that...
Is that similar vth string ending with.....?....i haven't find any difference
Super explaination and we need NFA with E-moves and without E-moves
If I wanted to have a set of all strings NOT containing 'bab' would I just make all the states other than my final state a final state?
hello bro ...your videos are very helpful ...do some more examples like even number of a , odd num of b and string with {0,1} divisible by 2 etc
Pass ho gaya kya?
@@arfatbagwan48 😂😂
@@brayshadow6592 kahan se ho ?
Thanks a lot for giving clear explanation. It helped a lot
Bro....just awesome🤘why don't my teacher teach me such a simple way🤷awesome bro .... Can you please upload video that string ends with ab and ba as well
I am confused on about what happens if there are two substring that can be accepted. Do I have two tables in that case?
Is it possible to get an unambiguous grammar for the language using this DFA?
It's really awsm technique bro but one thing... U said sigma for epsilon in the vedio that sol.... Tq bro
Perfect explanation.Thank you😊
how to construct when {a,b,c} which starts with 'a'and not having substring 'bac' in it??
Thanks a lot!!!!very helpful videos..great work☺
+Richa Mahajan
Thank you :)
The BootStrappers ☺
Handwriting looks attractive !!!!!!!!!!!!!
Nice video 👌 simple and easy to understand 👏
Brilliantly explained. please try and cover other topics in tcs too. NFA, turing theory, push down etc. If you have already, please share the link..
thanks...it was usefull..and d presentation was very nice
Can we use the same trick for NFA?
String ending with type or substring m difference Kya hua phr
I have same doubt
Thanks brother U make my engineering comfortable to get enough time for GF
Can you please explain when you have to construct a DNF that takes input at the begging and at the end
As q3 is final state so it should have double circles round.... Thanks for Teaching great work
how do you do this with 3 inputs that requires a subset with 3 letters such as abc?
You are a life saver, thank you!!!
guys Thanks a tone!!! Do you have similar methods for NFA??
Hello guys , thanks a lot for these easy solution , I came across a problem that says , "design a dfa for set of all strings with atlest one a and two b's. How do you solve this ???
This was brilliant! Thanks
great video, so easily explained and that too thoroughly,, keep it up guys!
+Kartikey Saxena
Thanks a ton!
@@TheBootStrappers hi sir NFA kahan se padhe ab
you're a lifesaver, thank you so much
very nice video. i could understand very well. pls make more videos on turing machine , PDA, RG, RE, CFG and NFA.
Why here you cant written the reject state but you mention the reject state in string video...because of this i am confused where i have to mention reject state or not.
Please answer.
best explanation, thank u so much , made it so easy
hey buddy can you explain what will happen if input string contains some other character like c or d ?
hii i have a question...?
how we can get whether to take null state in dfa..?
can you explain this trick for something like a^nb where n>=0
so nice, very easy steps. thanks dude.
very good explanation i really helpful u teach all videos. so i want more videos thank you so much ,,,
thank u soo much... this with transition table helps me a lot
Thanks for sharing your knowledge for others
Really cool bro .... 👌🏻👏
these videos helped me alot! liked all+ subscribed (Y) keep up the good work :)
What would the DFA be for not accepting words with substring bab?
Probably too late now but make all nodes that are not final states into final states and make all final state nodes into regular nodes.
Anguis Mors Thank you!!
Thanks these videos were really helpful!
very nice and clear explanation
You are brilliant!! Thanks a lot :D
Is q3 the final state? If not, what is the final state?
Yes q 3 is the final state.
Excellent job Boostrappers.. I have a doubt.. How to write a computer program, ex. in Java given a FSM? Are there any generic approach?
sir how u know that to take those strings only please help me
tq for the video.... it helpd a Lott....
Can u plz help with the string aabb i dont think this method is suitable for this problem plz help asap
what if the question is for not accepting the string containing bab.. then what should be done?
+Omkar Jadhav just change final state to non final and non final to final
Very helpful video! could you do one on 'How to get regular expression from a state diagram' ?
Hii sir I need all ur dfa video sir.... Thank you for the amazing videos sir
thanks my friend awesome explanation!
Boss your logic and explanation is super I saw your all dfa video those are very small and simple to understand tq
How to solve a problem containing substring 101 or 010 type of problem
Sir ending strings aba kaise krenge
Thank u soooooo much sir😊..... Plz do more videos sir... God bless u sir
don't we have to show q3 as the final state as in double circle it???
sir tell me plz how to make their Regular expression
nice video.....!!
can u also make a video of NFA please.....!!
dude super dude its so helpful
After taking ba how can u take bb?
will you pls upload for nfa, nfa to dfa conversion,re,pumping lema ..
Hi
Can you make the video for DFA which accepts even numbers
i haven't checked out your channel for other videos yet, i just came upon this playlist explaining DFA. Can you do NFA, Mealy, Moore, Turing Machines too?
You have nice background support by whoever your friend is!!! ;-P
q1)(DFA)automaton being contains neither the substring ab nor ba ?? can you please make a video on this types
and also
q2)string starts with 01 and ends with 01
you are the best, thank u so much
How to draw a DFA that either starts with or ends with or both with 0,1
Please make a dfa on both containing 11 and 010 as sub string please tell how I can find number of stages
It is very helpful. Thanks. Can you post more examples of this topic?
All strings except those containing 001 as substring over alphabet {0,1}?? Solutions bro
very very helpful....thank alot
These tips are super helpful, thank you so much!