Lec-7: DFA Example 1 | How to Construct DFA in TOC

#TheoryOfComputation #AutomataTheory #TOCByGateSmashers


In the video, Varun Sir has explained an example of a DFA. Design a DFA over the alphabet {a, b} that recognizes a language consisting of all strings containing at least one 'a'.

0:00 - Introduction
0:55 - Write all strings of Language (Contains 'a')
1:44 - Design DFA for the above language

►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:

[rituparnabarman]

You are a great teacher. I find your lecture very helpful. I studied for my university exams by watching your lectures for all subjects. Your lectures are awesome and easy to understand.

[AliSher-sxbp]

I can't take my classes organized by university but u'r videos are excellent for my course instead of online classes taken by the uni teachers..
ItX the save of time too
.. Lve u from🇵🇰

[devenderk.]

Sir, this video goes to blackout after 7.19 Duration. please do the needful.

[priyankgiri]

sir 7:18 ke baad video and audio dono nhi aare. Please do something about it.

[pratikchilkewar]

toc ka ab tak ka best video .
sare doubt clear hogaye sir
Thank you so

[bangankit]

I can't take my classes organized by university but u'r videos are excellent
thank you sir

[amanahmed]

SIR AAP APNAA KHUD KAA ONLINE COLLEGE OPEN KARLO
BEST RAHEGAA

[obaidabbasi]

Dear Varun,


I am preparing for CCNA and I find your videos "THE BEST". Thankyou so much for making complex things so easy. Love and respect all the way from Pakistan <3
Also, I wanted to know if you have any plan to teach CCNA?

[affanahmed]

but for example 1 as string ending with b is also acceptable (it just has to contain a) then automata at state q1 on implementing alphabet 'b' should return back to q1 so that it can accept strings like ab, abb, abbb, as it contains 'a'.

[KKinHD]

End with 'a' will be like this :
Q0 x b = Q0
Q0 x a = QF
QF x a = QF
QF x b = Q1
Q1 x b = Q1
Q1 x a = QF

QF is the final state, the dfa will be first Q0 - - > QF - - > Q1
Try it yourself with any string that ends with a and which doesn't.


Edit : The solution Is provided in next video in Playlist!

[VishalKumar-vwmg]

Total confusing, but still i understood. Ki padhna padega.... Practice chahiye.

And you done grate. 👌

[istaqkhan]

Apka bahat sukriya.... So bahat special ho....concepts ekdam clear ho jate hain

[shimulbhattacharjee]

You are explaining this series of TOC so beautifully. Love from Kolkata.

[MaxCse]

Another Very helpful Video!! Thanks ☺🖤

[Learntocode-balaji]

You are a very nice teacher..


Your teaching is very awesome

[game__lovers]

Sir thanks for this video its very helpful for me for
you are the best

[hemantkumar]

video goes to blackout after 7.19 Duration. please check it

[preetimandal]

Beautifully explained. Love from jaipur 🥰

[sudeshnasaha]

Love from Kolkata sir❤️❤️you are a great teacher ❤️❤️❤️

[ApnaChanel]

How (aab) string will be accept? If in question there is mention that the String will he end with a🤔