2.19 Important GATE PYQs | Deterministic Finite Automata DFA | Theory of Computation
ฝัง
- เผยแพร่เมื่อ 21 ธ.ค. 2024
- 📝 Please message us on WhatsApp: wa.me/91800012...
💻 KnowledgeGate Website: www.knowledgeg...
📲 KnowledgeGate Android App: tiny.cc/KG_Offi...
➡ Do not miss our Bestseller Courses:
🔴 GATE Guidance-2025: www.knowledgeg...
🟠 GATE Guidance-2026: www.knowledgeg...
➡ Contact Us:
🟩 Whatsapp Chat: wa.me/91859512...
📞Call on: +91-8000121313
🟦 Telegram Updates: t.me/kg_gate
🟩 Whatsapp Updates: www.whatsapp.c...
📧 Email: contact@knowledgegate.in
➡ Our One Shot Semester Exam Videos: 👇
▶ Operating System: • Complete Operating Sys...
▶ DBMS: • Complete DBMS Data Bas...
▶ Computer Network: • Complete CN Computer N...
▶ Digital Electronics: • Complete DE Digital El...
▶ Computer Architecture: • Complete COA Computer ...
▶ Data Structure: • Complete DS Data Struc...
▶ Algorithm: • Complete DAA Design an...
▶ Software Engineering: • Complete Software Engi...
▶ Theory of Computation: • Complete TOC Theory of...
▶ Compiler: • Complete CD Compiler D...
▶ Discrete Maths: • Complete DM Discrete M...
➡ Free Subject-Wise Complete PlayList: 👇
▶️ DBMS: tiny.cc/kg_yt_DBMS
▶️ Operating System: tiny.cc/kg_yt_OS
▶️ TOC|Automata: tiny.cc/kg_yt_toc
▶️ Computer Networks: tiny.cc/kg_yt_CN
▶️ Digital Electronics: tiny.cc/kg_yt_D...
▶️ Compiler Design: tiny.cc/kg_yt_C...
▶️ Computer Architecture: tiny.cc/kg_yt_COA
▶️ Data Structure: tiny.cc/kg_yt_D...
▶️ Algorithms: tiny.cc/kg_yt_A...
▶️ Set, Relation, Function: tiny.cc/kg_yt_D...
▶️ Graph Theory: tiny.cc/kg_yt_g...
▶️ Group Theory: tiny.cc/kg_yt_g...
▶️ Proposition: tiny.cc/kg_yt_p...
#knowledgegate #GATE #sanchitjain
*********************************************************
For complete Theory of Computation, check out this video:
th-cam.com/video/9kuynHcM3UA/w-d-xo.html
For last question, |W|=0(mod 500) {since it is divisible by 500 therefore in the formula r(mod n) r=0 and n ==500}
hence no . of states = n = 500
Hence, option (d) is right.
isn't n - 1 always?
yes it is but from 0 to 499 would still be 500 states@@justforbusiness9753
Thank You for making these videos sir, I have my mid semester examination and watching your entire playlist, these videos are helping me a lot
You're welcome and All the Best for your exams! Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
500 is correct
Thanh u sir u make TOC much more easier for u.👏
Most welcome! Keep learning & supporting! Stay connected for more amazing videos & contents 👍 You can also check out our CS bundle course for complete preparation of Computer Science subjects, sharing course link below:
www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
one of the best teacher in TOC world 🥰🥰🥰🥰
Thank you so much for your kind words😍Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Regular Expreession (aa... 500 times)(aaa... 500times)* so atleast 500 states are required for dfa.
500 states for the last question. 👌👌
Divisible by 500 means remainder can be 0_499 so state =500
Option (d)
sir
9:23 pr apne kaha ki bbb is not a string but sir w is not containing aa as a substring na
answer is 500 for the HW question
Aapke jaisa toh hamare college me bhi nhi padha sakte 🙏🙂❤️
Thanks a lot dear for your kind words❤Keep learning & supporting! Stay connected for more amazing videos & upcoming contents 👍😊
option D 500 states
How
In home work question : answer may be , Option D (500)
Ap sab easy kardete ho toc ko keep motivating us
Glad to know this❤Keep learning & supporting! Stay connected for more amazing videos & upcoming contents 👍😊You can also check out our CS bundle course for complete preparation of Computer Science subjects, sharing course link below:
www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
One of the best teacher
Thanks a lot dear for your kind words❤Keep learning & supporting! Stay connected for more amazing videos & upcoming contents 👍😊
Thanks sir 🎉🎉🎉🎉🎉🎉
Super class thanks sir
You're welcome dear ❤ Keep learning & stay connected for more amazing contents 👍
*|w|x = 0(mod 500) so state is n-1, 0-499, 500 states*
i have doubt in question no.2 when we are making |w|=2 initally why we are not taking care of dead state then including that answer will be 9 instead of 8 can anyone please clearify that ?
Dear @Saksham, we don't take the dead state into account because that's how it's done according to the set convention.
Sir u r GoD for ENGINEERING students
❤hw- 500 states
Thank you so much Nihar for your kind words, keep learning & supporting❤
@@KNOWLEDGEGATE_kg❤
Just awesome sir 🥹
Thanks a ton! 😍Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
Thanku for this toc playlist
You are welcome dear @Sheetal, keep learning & stay connected👍
D is the right answer
In question 2, since the language is {a,b}* that means it includes epselon.
if so that there should be transition from q0 -> q7.
Correct me if i am wrong?
In Q3 for option (B), bbb is satisfying the condition but it is not in the DFA. Then why it is correct??
there is a loop for b in initial state for b
In Q3 option b says that a is followed by at least two b which satisfies the condition and also accepted in DFA thus it is correct
and for your "bbb" is not satisfying the condition so how it can be true.
for the last HW question answer is 500 states
Sir plz make videos on : Context free language to context free grammar conversion
My exams are after 1 month
I need it ,plzzzzz
It is a humble request to u sir
Dear Shakeel, for complete course on TOC, please check out our course link below:
www.knowledgegate.in/learn/Zero-to-Hero-Theory-Of-Computation-Automata-by-Sanchit-Jain
Gate 2005 wale question me option c me substring abb accept ho rahi hai sir abba me bhi substring abb hai then why option c is wrong
sir gate 2017 me q4 dead state kaise hua samajh me nhi aaya
D is correct
option d
Thank you sir
You're welcome! Keep learning & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
#sanchit sir
option D is right
Sir net exam mai turning machine se 5 que aye the plz usse depth mai kra dijye
Sure dear! Also, for complete topics of TOC, you can check out this course on our website, sharing the link below:
www.knowledgegate.in/learn/Zero-to-Hero-Theory-Of-Computation-Automata-by-Sanchit-Jain
isnt 011 will also be selected in first question, though its not starting and ending with same digit???????
Option d
500 correct ans.
GATE 2005 3rd QUESTION
All the options are incorrect.
B is wrong because it does accept a with atleast 2b but it doesn't not accept those strings which contain only b , Because if a is present then it should be followed by atleast 2b's but if only b is present then there is no condition hence "STRING HAVING 0 A'S MUST BE ACCEPTED". Example (€,b.bb,etc) Basically it wont accept b*.
If initial state was also final state then in that case option B would have been the correct answer.
Answer is 500.. I have a little confusion in 4th question
Homework answer is D
500 state as we have learned that we have state same as number of n
Homework Question Answer-Option D=>500.
option d sir ji ...
Last Question answer- d)500
Homework answer is 500
In abba.. after completing this string.It contains abb.then why it is not a substring
the ans wil be 500 staes for the last qustion
D. 500
500 states because n = 500
D
500 is correct
500 states
500
500 is correct
500
500
500