Deterministic Finite Automata ( DFA ) with (Type 2: Strings starting with)Examples
ฝัง
- เผยแพร่เมื่อ 8 มิ.ย. 2015
- This is the 2nd video of the new video series "Theoretical Computer Science(TCS)" guys :) Hope you guys get a clear understanding of this subject
Thank you guys for watching. If you liked it please leave a comment below it really helps to keep m going!:)
![ความรักของยักษ์เขียว (ทศกัณฐ์) - เดี่ยว ไออุ่น [OFFICIAL MUSICVIDEO 4K]](http://i.ytimg.com/vi/yCCy-QVHqK8/mqdefault.jpg)
the guy who taught in the first tutorial was awesome...he was really good.
TQ bro super
8yrs later the video helping us out. Thanks for this masterpiece sir🙌🏾🙌🏾
Don't forget two circles around q3!
Great video thank you!!!
Right, since it is the final state.
Thank you. You explained the topic really clearly. Just a minor thing you forgot is showing the accepting and the start states in the transition diagram.
Brother you are just awesome yarr,you just corrected my 3hr doubt in 7 min, love from maharashtra bro..... 🤞🤞
That was an amazing video. Thanks a lot, i really understood the topic.
Thank you! Really helped in clearing the concept!
Ideal method to find the logic easily, thank you 😊
man o man what a great way of teaching love this gb ....
I like the way you categorize the problems.
+Free Express That's me doing my job right :-)
Its really helpful thank you
you guys made it really easy for me to understand
keep it up, you're doing a great job.
So Great! all series
Good Technique. Very good for starters.
Keep it up
it's Awsome to learn and pass my subject ...before that m blank regard to this subject. keep it up
Awesome video loved it thanks
Thanks a lot, it’s very helpful. Hope you can explain the NFA too.
It's been 8 years since this video's but I hope you recovered from your cold quickly. ❤
Excellent work
FIrst Video guy AWESOME WORK
Superb tutorial. I'd love to learn till the end of this entire tutorial series.
just a qq: why are you learning it at age 50?
Ur awesome dude it's very easy and helpfull
These videos are awesome!!!!!!!
+Huan Gu
Thank you :)
Vere Level bro super explanation
amazingg.......😄😄
However u have taught...it helped me a lot thankx yaar
Awsome somethings goes in my mind.. otherwise in my uni class I m blank...
very nice video..mera concept clear ho gya..so happy
Nailed it ...
It's really helpfull... I understand much.
Great!
MAN ,, I LOOOOOOOOOOVE YOU !!!!! YOU ARE AMAZING !! THANKS THANKS !!! I CAN NOT REPAY YOU BY MY LIFE EVEN
love you too reham
Thank u so much for adding this.. video it helped me a lot to understand how to construct DFA tq
hi pooja how are you dear? thank you
awesome duuuuuuuuuuuuuuude..!!! (Y)
Awesome Videoo!!!!!
awesome !!!!
Thank You very much for your help
You are awesome..Please do more videos
Thank you for saving my time! Great method, I'm wondering why didn't my instructor use it?
Great!! Thank you...
Hello, thanks for the video, it really helps.. My question is you don't indicate the arrow for initial state and also double circle for final state or it doesn't have?
Super teaching 👌👌👌👌very interesting
This is super helpful guys
Good stuff, congratulations and thank you very much
Anything for NFA
Awesome
Hi! Loved your videos, they were extremely helpful. I was wondering how to tackle a problem with the following reg expression c(aUb)(aUb)*b. I'm trying to follow your process but I get stuck how to write the table. Thanks!
thanks buddy its help me
For the last state shouldn't that be double circled to show that it is an accepting state?
Can u plz upload videos of how to construct nfa...your videos r really good
Post complete course videos. Its a good methods u r following
thnx buddy
the way you touth is awsome
simply yr great
my mid exam in near on next week kindly upload other part of dfs
thanx again
+Yousaf Nadeem
Thank you :)
GOD BLESS YOU !!!!!!! SINCE 😀
Thank you bruh
Thanks.... bro... :)
Thanks a lot :)
Were you said when" a"combines with" q1", making it "aa" ..
This makes it start from a and it's not supposed to be assigned to the rejected state "q¤"
U are right it will start from q1
if you make it start from a, you would end up making a state machine that searches anywhere in the string...not the EXACT beginning
thanks a lot can u plz share more video on automata Theory as erly as possible my paper is aftr two days
Thanks brotha
Awesome..with correct logical reasoning.
Thanks a ton :)
Please do add more complicated examples..and videos on other topics as well,thanks :)
Plz also make a video on having with dfa
can u give an example having more than 2 inputs ? it would be very helpful
ty bro, thanks a lot. . . .
It has helped me a lot...
What about not starting with something? Will making the non final states, final, do?
Plz add a video of Nfa to DFA conversion 😊
Thank you very much, very nice videos. Please someone clarify , at q2 when we got b we go to q-fi, then how it will be possible to have b on final state?
Plz made a similar video on NFA ,if possible .
how do i know i need to do with reject state
when question is end with,why i dont need to have reject state
Could you do video lesson about Turing Machine? ^^
thank you.......
thank you
you saved me omg
How will I come to know that when I have to take the reject state?
very helpful 🐇🐇
is the accept state q3? Also, If asked: all strings not starting with aba, do we put all except q3?
Please upload the videos of DFA of even 0's and odd's and similar type of examples
Your all videos are good.....but you please add the video for the following type.....
L = {b^m a b^n whereas m,n >0 }......and sigma ={a,b}...Thankz in advance
what happen if the input is 'a' only?
Teach minimization of automata using table filling algorithm
Could you please upload topics of NFA (non deterministic finite automata) , converting NFA to DFA ,minimisation of DFA,E-transitions , Mealy and moore machines in Formal Language Automata Theory (FLAT) subject ...
How the DFA would be for strings ending with b?
Is it compulsory to add reject in the table and daigram
+ The BootStrappers
Thank you.
Upload video of designing nfa with this method similar like of dfa
the self loops for a and b must be drawn individually, for exam purpose :)
Why didn't u use a reject in the type 1 ie. Strings ending with 100?
Yes same question .please clear our doubt
Are u clear now?? If yes please tell me y?
The two cases are different in the sense that the search position is different. The previous video searched it at the end of the string. So if a wrong combination appears, it still continues to look further. In this case, it searches in the beginning, so if not in the beginning then reject.
Why we take aba in this question since it only asking about the starting with ab
Then we should not take this state
awesome vidio
+unlimited entertaiment (shuvo)
Thank you :)
can u plz Uplod more videos of Another topic..PDA Or Grammar..
Why we can use reject state
At 5:30 in q2 state why you make it dead state there is a chance for making it q2??
sir what about answer when he will ask that substring is aab what we have to do...
it's really helpful bro.....thank u soo much......
but can u explain the difference between nfa & dfa please
bro get a life?
your videos are really good. Can you do the following problem
design a dfa that has exactly two 1s and at least two 0s
Thank you :)
Could you please make a video on construction of NFA in easy method
thank you for teaching us DFA but in this video you forgot to encircle the final state and put an arrow to the initial state.. some students like me might get a deduction for it... small detail but might as well include it :)
Thanks, will do :)
Harvey Bobila bro...its my mistake ur were r8.....i got my mistake €a is not there so € cut then a is there with q1.....and u have taken q1 soo its coorrect....thnxx...bro....u made my concept clear regarding the automato
Vishwakarma Raj I'm done with my automata class btw. thank you for creating videos like this bro it helped me pass the subject. keep up the good work you're helping a lot of students out here 🖒
@@harveybobila4403 so which is the final state?? Please reply me!
@@yasminshaikh8583 q3
can you tell me when we use rejected state or when we not use
can anyone just clear my one doubt.... i m getting confused in the question in :::: string ending with abb
when we will have abba as a value in transition table as a whole it will not be there so we will seperately consider each alphabet or set????????
i want the video lecture to solve string having 101 as a substring at any place starting,ending and in mid in a question
Give more examples bro 😊😊
When there comes aa in q1 how you put there q.reject
hey can you please tell how to work with two strings using above same technique ?
like .. FA that accept exactly two strings, baa and ab ... please help because tomorrow is my exam !