Deterministic Finite Automata ( DFA ) with (Type 1: Strings ending with)Examples
Deterministic Finite Automata ( DFA ) with (Type 1: Strings ending with)Examples
This is the first 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!:)
You help me a lot. Thank you:). but, Can you help me for another problem how to only accepting a specified substring in specified occurrence:(
Anyone here from university of west London?
Transition table is not at all clear.
Plz make more videos in this subject
God bless you bruhh
BROOOOOOOOOO. Teacher log ko aise samjhaane kyu nhi hota hai. Thank you soooooooooooooomuch bro
Lol you hacked the subject itself ๐๐๐
Ur jstt amazeee jst in 9mins u taughts veryy well dude ur superbb
Yeh to simple tha isaliye pata chal gaya final state q3 he lekin agar final state ek se zyada ho tab jaise pata chalega k yahi final state h yah aap n bataya nahi ki final state kaise pata chalega
Awesome man… Great job. It seems easy… To learn…ur just like.. a Heisenberg in breaking bad๐๐
Super brooo
BRO THIS TECHNIC WORK FOR NFA
Thanks for last minute tip.try to upload more videos related to this subject.atlast thank u
Thank you so much brother.. This video helped me a lot ๐
Bro….you’re my life saver…
https://youtu.be/6OLtIBShlfY
Plz can u make more vdo’s on TOC , it will really helpful during this lockdown
Thank you brother .
Thank you very much . Easy and life saving
This something else man
No where i find this thanks for the video
Thanks ๐คฉโค๏ธ
It’s very irritating and boring video just because of your voice
remaning concepts where
Uu uuuu don’t deserve dislike man
This doesnโt work for the string ending with 0 kindly see to it
thought of skipping the video but after 2 mins I couldnt stop watching ur videos
Really super video it helps me alot
The 0,1,011,etc you are taking in while forming transition will be same….how to take in other conditions….
Thanks for u ๐ I am so glad I understand ur video .ur way of teaching neat nd clean ๐again thank you so much ๐ฅฐ
Devil whisper in his ear ๐๐
Btw
Great work
Please help to solve the problem
Let L1 = {binary strings with odd number of 0’s} and L2 = {binary strings begin with 01}.
a) Construct DFS for L1
b) Contruct NFA for L2(which is not DFA) and then convert to DFA
c)Construct DFA for L1 U L2(union).
massive respect ++++++++++
Literally no words ๐ช
smoothly understand thanks for this video
Indian brain is amazing. Full of respect
hey i like the way you solve question of constructing string by making transition diagram can you please solve me a question
The question is like this:
Give the DFA for language of strings over {a, b} where no
two consecutive aโs occurred.
Thanks a lot!
๐ฆโ๐ผโ๐ชโ๐ธโ๐ดโ๐ฒโ๐ชโ ๐ ฑ๏ธ๐๏ธ๐ พ๏ธ…
Best video to understand dfa
came here because of online classes in 2020. my mind became a soup afterwards. but nice tutorial!
Thank you so much ๐
Thankyou so much!
This video helped me a lot
your 2 examples are not proof of correctness as proof positive by example is not a valid proof technique.
PLease start a writing tutorial i cant write like that
HO MAN REALLY AMAZING IT HELPED A LOT
Perfect method
Well explained ๐
thank u fr cutting method
Thank you so much ๐
AWEEEEEESOMEEEEEE”
Excellent explanation bro๐๐