Lec-11: DFA of all strings in which 2nd symbol is '0' and 4th symbol is '1' | DFA Example 6

preview_player
Показать описание
#TheoryOfComputation #AutomataTheory #TOCByGateSmashers

In the video, Varun Sir has explained an example of a DFA. Design a DFA over the alphabet {0, 1} that recognizes a language in which 2nd symbol is '0' and 4th symbol is '1'

0:00 - Introduction
0:13 - Minimum length of string
1:45 - Minimum States
2:17 - Design DFA

►Theory of Computation (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Software Engineering:
►Artificial Intelligence:
►Computer Networks:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Programming in C :
►Data Structure:
►Computer Architecture :
►Graph Theory (Complete Playlist):
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

From the very first day of my lecture in college, I was struggling understanding this Subject. You made it look so easy sir. Thank You So Much.

tirthpatel
Автор

With ur simplicity you explain simply. Thanks😊

khushbuchandrakar
Автор

Felt good when I did this question myself! Thank you, sir!

yashasvisharma
Автор

Thank you so much Varun sir for such a wonderful playlist! I bet no university professor can teach this subject with such an ease!!

rishitbhojak
Автор

sir you explained really well and very
You deserve nobel price sir..thank you so much sir
kudos..

code_kraft
Автор

Thanks to this man to getting us videos to learn fast instead of spending time on attending lectures and fat books

DevangPanwar
Автор

previous videos se sikh ke similar DFA bana lia then video resume kia 😃. bas mene common nai lia death trap. separate rakha tha aur end me 1, 0 ka loop nai dala tha final state me.. learned it. Thanks
Maza agaya.

kishor-jena
Автор

Its getting easy to understand!!!
Thank you so much sir!✌✌🌈

golden_bish
Автор

Thanku soo much for this simple solved questions

Zynbvlogs
Автор

Thank you Sir. Your teaching style is very easy to follow. well presented videos on this topic..

himanshulal
Автор

I was really happy when I got the write answer, before he even explained it

aaryanbhende
Автор

Hello sir! Pls solved my doubt
Sir can we make different trap state for q1 and q3

Vanshbajaj
Автор

Sir, I must say you are the saviour of all computer science students

avrajitkundu
Автор

Sir ap jo punjabi accent mein teach krte ho usse apnapan lgta hai.. u r truly legend.. ❤❤❤❤❤❤❤❤lots of respect... 🙏 hmare guru

ms.shivanithakur
Автор

wah, maza aa gya sir... what a teaching style keep carry on sir.

gauravsaini
Автор

Sir your explanation ia awesome. Thank you very much:D

nandiniagrawal
Автор

Thank you so much Sir for your helpful videos.

AdityaSharma-wbrs
Автор

Sir!.Kindly share Examples of NFA please

aemanmustafa
Автор

It is very hard to understand this subject.

karthikchand
Автор

sir, Is it wrong to use multiply trap state instead of using minimum no. of trap state (from university exam point of view )
and thank-you for making these lectures...all of my classmates learns from your Lectures .

ansulyadav