3 Simple Tricks to Construct DFA| DFA for Beginners| TOC

  Рет қаралды 33,452

Chirag Lecture Tutorials

Chirag Lecture Tutorials

Күн бұрын

Topics covered in the video-
1) 3 Simple Tricks to Construct DFA
2) How to construct DFA for different Languages
3) Acceptance of Right Strings and Rejection of Wrong Strings
4) GATE Level Questions
For details, please watch the video till the End
Get the handwritten notes of Tricks to construct DFA
Downloading Link: drive.google.c...
Watch the complete Theory of Computation Lectures-
• Introduction to Theory...
Social Media Handles
Follow Me on Instagram: @chirag_sharma1510
Follow Me on Linkedin : / chirag-sharma-687857193
#TheoryOfComputation #AutomataTheory
For any doubts and Queries Comment Below
Kindly Like, Share and Subscribe on the Channel, Your Support is valuable in this initiative.

Пікірлер: 38
@farheenshaikh6724
@farheenshaikh6724 11 күн бұрын
Just watched this DFA breakdown and it was 🔥! Super clear and really helped me get a grip on the concept. Thanks for making it so easy to understand-you're a lifesaver! 🙌🚀
@ChiragLectureTutorials
@ChiragLectureTutorials 10 күн бұрын
Thank you!, Keep sharing, More good content will be coming.
@InsanePiyush
@InsanePiyush 2 жыл бұрын
This is the best lecture I found on construction of DFA 🔥
@ChiragLectureTutorials
@ChiragLectureTutorials 2 жыл бұрын
Thanks very much
@mohammadshafaque8881
@mohammadshafaque8881 9 ай бұрын
Best lecture on DFA ever❤❤❤❤
@ChiragLectureTutorials
@ChiragLectureTutorials 9 ай бұрын
Thank you
@3110mimi
@3110mimi Жыл бұрын
Best lecture on DFA ever, i appreciate it bro🎉
@ChiragLectureTutorials
@ChiragLectureTutorials Жыл бұрын
Glad it was helpful!
@pankajsirari4231
@pankajsirari4231 2 жыл бұрын
Thank you Sir for this detailed lecture, it helped a lot.
@ChiragLectureTutorials
@ChiragLectureTutorials 2 жыл бұрын
Glad it helped
@rajsinghsenger6774
@rajsinghsenger6774 2 жыл бұрын
Thankyou for your explanation sir ..it makes the concept clear
@ChiragLectureTutorials
@ChiragLectureTutorials 2 жыл бұрын
You are welcome
@raunakraj3331
@raunakraj3331 2 жыл бұрын
Well Explained Great Video Sir💖🔥
@varunsingh8999
@varunsingh8999 2 жыл бұрын
Thank you sir 😊
@ChiragLectureTutorials
@ChiragLectureTutorials 2 жыл бұрын
Most welcome
@rjeight
@rjeight Ай бұрын
the BESTTT
@ChiragLectureTutorials
@ChiragLectureTutorials Ай бұрын
Thank you Keep subscribing
@abyssofpg
@abyssofpg Жыл бұрын
thank you chirag , the video was helpful
@ChiragLectureTutorials
@ChiragLectureTutorials Жыл бұрын
Most welcome!
@amansheikh3728
@amansheikh3728 8 сағат бұрын
If we go from q1-a->q2 and q1-b->q0 so from this we can make babab which is wrong string , check on 21:57 ,please explain me this
@ashiyashaikh5275
@ashiyashaikh5275 25 күн бұрын
@computerproton4735
@computerproton4735 Ай бұрын
10:54 why is this? How aa is accepted?
@ChiragLectureTutorials
@ChiragLectureTutorials Ай бұрын
I said aa can't be accepted as string with ab should be accepted, aa does not contain any b so it won't be getting accepted.
@ritikesh9162
@ritikesh9162 2 жыл бұрын
sir in qyes 2 we can create self loop of b as well at q2 so that we can have the string ( baabb) we can also accept this string n sir
@ChiragLectureTutorials
@ChiragLectureTutorials 2 жыл бұрын
Hi we can’t take self loop of b on q2 as it can accept abab that would mean aab is not contained in it hence we won’t apply loop of b on q2
@amansheikh3728
@amansheikh3728 8 сағат бұрын
If we go from q1-a->q2 and q1-b->q0 so from this we can make babab which is wrong string , check on 21:57 ,please explain me this
@milanrai3607
@milanrai3607 6 күн бұрын
Construct a DFA over Σ = {a, b}. Using the definitoin of occw1(w) to mean the number of times the substring w1 appears in string w, L1 ={w∈Σ∗ :occaba(w) mod2=0} Accepted Strings: λ, a, b, ba, ababa, bbbbabaaaaabaaababa, abaaba, babababab, aabaabaabaabaa, ababbaba Anyone expert in DFA ....!
@ChiragLectureTutorials
@ChiragLectureTutorials 4 күн бұрын
Let’s do it Frame your question properly
@climbersisyphus
@climbersisyphus 6 ай бұрын
so you're able to have 2 final states in DFA? I thought you could only have one. seems like you have q0 and q1 as final states.
@ChiragLectureTutorials
@ChiragLectureTutorials 6 ай бұрын
Yes we can have multiple final states in DFA but only 1 initial state in DFA, If we can have 2 answers getting accepted via different states, those will act as final states
@beingyourself4553
@beingyourself4553 Жыл бұрын
ab wrong answer ? 7:51
@ChiragLectureTutorials
@ChiragLectureTutorials Жыл бұрын
Thanks for pointing out, Its fixed
@kINg_Of_yOuTuBe__
@kINg_Of_yOuTuBe__ 4 ай бұрын
This is wrong The question was to accept string ab Not accept strings that contain ab Understand the difference 😂
@ChiragLectureTutorials
@ChiragLectureTutorials 4 ай бұрын
The question is regarding string containing ab
@soumyaranjansamalkiit
@soumyaranjansamalkiit Жыл бұрын
is this the simple trick?
@ChiragLectureTutorials
@ChiragLectureTutorials Жыл бұрын
Yes soumya, Apparently this is the simplest one
@sugyanpratiksatapathy3188
@sugyanpratiksatapathy3188 2 жыл бұрын
Thank you sir🙏
@ChiragLectureTutorials
@ChiragLectureTutorials 2 жыл бұрын
Most welcome
Шок. Никокадо Авокадо похудел на 110 кг
00:44
2 Simple Tricks to Convert NFA into DFA| Simplest Method| Theory of Computation
20:39
Chirag Lecture Tutorials
Рет қаралды 2,4 М.
Non-Deterministic Automata - Computerphile
21:09
Computerphile
Рет қаралды 53 М.
Minimization of DFA (Example 1)
15:56
Neso Academy
Рет қаралды 1,6 МЛН
What La Niña Will do to Earth in 2025
19:03
Astrum
Рет қаралды 486 М.
Regular Languages: Deterministic Finite Automaton (DFA)
6:28
Theory of Computation: Example for DFA (Divisible by 3)
7:28