4.4 How to identify Regular Language? | Practice problem on Regular Language Identification | TOC
ฝัง
- เผยแพร่เมื่อ 25 ส.ค. 2024
- 📝 Talk to Sanchit Sir: forms.gle/WCAF...
💻 KnowledgeGate Website: www.knowledgeg...
📲 KnowledgeGate Android App: tiny.cc/KG_Offi...
➡ Do not miss our Bestseller Courses:
🔴 GATE Guidance-2025: www.knowledgeg...
🟠 GATE Guidance Plus-2025: 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
*********************************************************
![[TH] 2024 PMSL SEA W2D5 | Fall | พลาดวันนี้ จะต้องเสียใจ](http://i.ytimg.com/vi/A5-Cuo12p6A/mqdefault.jpg)
For complete Theory of Computation, check out this video:
th-cam.com/video/9kuynHcM3UA/w-d-xo.html
Although im B.Tech and MTech in CSE, In my life, I understood TOC first time. Thanks sir
Glad to hear that,Visit www.knowledgegate.in for more helpful content and courses !!
sir this series of toc was the best available tutorial to understand this subject in simplest way... completed the entire series... waiting for more videos..:)sir you are doing excellent job..
I guess I am quite off topic but does anybody know a good place to watch newly released movies online?
@Jensen Leo I would suggest flixzone. Just search on google for it :)
@Jensen Leo I would suggest FlixZone. You can find it by googling :)
sir,in example 32 ,can we take w as either a or b so it will be like a string starting and ending with the same symbol
Dhanyawad sir ji😆
Every lecture is very useful.
I can't stop myself watching them😃
Hello Sir. You are working very hard for we students. Lectures are very lucid and self contented. Thanks a lot. You are such a teacher having apposite character.
thanks a lot satyasprya...
Thankyou sir! I am a GATE Aspirant and all your tutorials are really helpful for preparation too......
Tricky questions.. awesome explanation. In every video i had gone through so far in KG, there is definitely a Genuine effort to make us understand the basics. Which i really appreciate.
This is a very very useful set of videos on TOC, a complex topic as far as the competitive exams are concerned. Hope to see more and more complete set videos on other topics as well in the coming days. Thanks a lot.
Hi !
Thank you sir for great TOC videos. I have watched all ToC - English videos and hindi videos (till this video).
It helps me a lot for competition.
Sir please complete the TOC series, if anything left for Gate. Thank u.
May God bless you for such great work and gives u internal happiness.
Afterall, money is important but not everything.
In case of question no 32 if we take w=a. Than the language starting and ending with same symbol. So it should me a regular language
I have studied this sub fst tym ...... I understood this in one go onlyyyy thanks a lot sir
Thank you very much. You are a genius.
You're welcome dear 😍 Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊
your teaching style is awesome sir .you save my time thanks a lots
e wala vedio bhut tagra tha guru g
just awesome sir
Thanks for it
Excellent sir..
sir pls cover important topics from networking
Thank you so much sir for your sharing your knowledge and guiding us.
THANK YOU sir your videos are amazing!!!!!!
sir please make full syllabus,,, for gate
sir please upload videos on context free languages and context sensitive languages, finite state machines, finite state models,and conversion of mealy to moorey machine and vice versa
sir you are the best... thank u very much sir...
Thanku so much sir.... your way of teaching is excellent..
Nice videos | Nice serious |
it was fabulous beyond superb... sir plzz make more videos
After watching ur videos,everything bcm easy and confidence boost up :) tysm sir
Interesting
Thank you dear @Rashmi❤ Keep learning & supporting! Stay connected for more amazing contents & videos 👍
sir in 32 exercise if we take abba means w=a and c=bb then we can draw fsm for it
Thank you sir.... My dought is clear in this video......
Great sir and thank you so much
#imp questions
Thanks sir
Thankyou sir
starting and ending with same string ho jayega agar 32 mein |w|=1 le lenge to w k lie machine bna skte h
Great work sir!
Sir please upload videos on the remaining parts of TOC mainly CFG and PDA.
Thank you sir for your hard work we will also do the same and try to crack GATE.
sir please upload videos of data structures from competitive point of view
thanku sir
Nice job sirr.....👍
Seriously!1 dislike!are you alien or something!aAwesome sir!thank you!
Thanx alot sir
best
keep it up sir ..........
In 32 question the symbol ending with different symbols?
Sir,you are my brother, not teacher!
Aisa lagta haii apna bhai pada rha haii.
thank you.sir..
Sir, Please upload the videos on computer organisation and architecture.
Mealey and Moore machine lecture
But I think there is some problems in 23,24,25,26 because they can also accept the strings that do not belong to language
Thanks sir but also upload software engineering as net point of view thanks again sir
Thanks Sir but also uploaded some other sub videos as computer network,AI UGC net point of view
27th is a regular language..... and u can draw a nfa for that like even a and even b at final position for w wr with size 1
just in previous 4.3 lecture there was same problem (c,w belongs to kleene closure). but there sir you use empty for both w and wr . In this video you are you pattern matching how came this possible in positive closure .
Hello Sir,
I really think that this playlist is more than enough for any examination and i have personally finished this whole playlist but I am having problem in solving decidable and undecidable problems asked in GATE examination in which they ask whether a certain problem is decidable or not, So can you make videos explaining that concept as well so it is helpful for me in GATE 2024?
Thank You
Dear Param, if you are looking for complete preparation course for GATE exam, then you can check out our course link below:
www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
@@KNOWLEDGEGATE_kg Ok Thank You Sir
sir in question 27, if we consider w to be a then its reverse will be a and c could be anything. In that scenario won't it be like ending with two same symbols? For eg if w=a,w'=a, and c=ababb, the string becomes ababbaa. We can make a machine for this. This string is getting accepted. How is it not regular?
sir, your teaching made this subject simple. tq sooooooo much sir
pls upload videos for CN
can't we assume in 10:02 that w is i lenght, so our WcW will become reg.language?????
Sir, you proving these examples as r.l just by taking the least possible length of w, i.e just one case is true for being called as r.l , but to prove something true we need all the cases to be true, so how this thing can be justified.
Awesome
How to Calculate complement of regular expression
27 and 28 are regulars
Q27 second explanation..? what was wrong in it
if cww is regular when w belongs to kleene closure, then why not ww is not regular when w belongs to kleene closure too? if we take w as epsilon, then language will be phy.. please explain sir
Sir as you explained in 26th example we can take one string(a) for W and W(reverse).Why this same logic is not applied on 17,18 or other examples.There also we can take single string and we can make DFA. So that can also be Regular.I will do wait for your reply whether i am saying correct or not?
Swati Sharma
Because in Q. 17th and 18th, 'c' doesn't belongs to ( sigma star or sigma plus ).
Seems like you aren't watching with full concentration or maybe someone disturbs you in between.
Sir in question no. 27 w and w(r) belongs to + so we can choose at least 1 symbol for w.
If I take w =a then w(r) also be 'a' or if w=b then w(r)=b , as c goes on large . Now we can make a dfa accept all string ending 'aa' or 'bb'. So that it is regular. Correct me if I'm wrong?
yeah i was thinking same
Sir please Upload videos on ADBMS, DAA, DATASTRUCTURE, and ULP in Hindi....Please Hurry Up sirrrrrr
but sir even if we assume that w = NULL, c belongs to 9a,b+...so how can infinite comparisions be done by FA?
sir i the string is abb and the wr=bba but by when aba is there in reverse part then it also go to final state but this is not coorect dfa
plz clear my doubt
L1 = {(ab)^n a^k | n > k, k >=0}
L2 = {a^n b^m | n not equal to m}
sir which lang is regular or not
Aniruddha Phadke both languages are non regular
Please solve this question. I have confusion about these type of questions.
The regular expression for the complement of the language L = {anbm|n ≥ 4, m ≤ 3} is:
SIR PIPELINE AUR MULTILEVEL PAGING PLEASE
in example 27 c=w*
w={a,b}
L={{{a,b}*aa}U{{a,b}*bb}}
can i do this .??????
in 27 problem c w wr can we take w as "a" and make dfa as language ends with aa.please answer fast
Same doubt
I think this language should be regular as we can make a dfa for "aa" and "bb"(considering w as a single symbol a or b) after accepting c
@@rohitprasad1447 We can not be sure take an example, consider c=abbab ,w=abb,w^r=bba.Now this string should be accepted but from your dfa logic the last two symbols are different so your dfa will reject it thus there is no dfa for it.
Sir there was a question in net L={a^m b^n |gcd(m,n)=1} is regular or not and another question L={a^m b^n | m+n=even }...In both the cases we are using values of m and but no comparison but one is not regulare and second is regular.Why ? Plz explain
better than ravindra babu
if we consider w to be a or b then what will happen? it will become a question of string ending with aa or bb which is regular??
Questions from 28 that have you explained on wcw belongs to €* or €+ is regular because you have been taking w to be of 0 length or 1 length ... But what if we have more than one length of w .. in that cases the language would not be regular
Ok, here is my explanation. We must make sure that the finite automata that we build must accept the correct language. If L = ab babb bbab, where [c= ab, w = babb, wr = bbab]. Now the automata we build must accept this language, but your automata(ends with aa or bb) does not accept this language. If the automata cannot even accept the right language, then the automata you build is incorrect. If you look at the other examples, you will see that automatas for the questions with tick marks accepts the regular language.
Why wcw is not RL? It should be RL na as we take W as single alphabet A
I have a doubt, if we can consider 'w' to be a string favourable to make the language regular, why cannot we do this for question no.16?
L={wcw^r | w (belongs to) 3^*(sigma star)}, here you have concluded this language to be non regular but we can claim this to be regular by considering 'w' to be a string of single element?
Please answer.
c doesn't belongs to the set of acceptable strings there .
Thank You Sir
Most welcome dear! Keep learning & stay connected! You can also check out our website www.knowledgegate.in for more amazing videos & contents👍😊
If I get confusion at somewhere on GATE question...I Come here at knowledge Gate
Glad to know that Ribhu, keep supporting. Please visit our website www.knowledgegate.in for more courses and contents !!
Sir, question no 27) L={containing all the string ending with aa or bb } so, could it be regular ?
(q3)---------->----b-----((q4))
|
| b
^
|
---->---- selftloop(a,b)(q0)----->-- a-----(q1)----->---a---((q2))
|
I also think this is possible. Can anybody else confirm this?
Ok, here is my explanation. We must make sure that the finite automata that we build must accept the correct language. If L = ab babb bbab, where [c= ab, w = babb, wr = bbab]. Now the automata we build must accept this language, but your automata(ends with aa or bb) does not accept this language. If the automata cannot even accept the right language, then the automata you build is incorrect. If you look at the other examples, you will see that automatas for the questions with tick marks accepts the regular language.
hello sir!!!!!!
Will you add more videos covering later parts of TOC ???
Sir....compiler design
Sir, Why don't you teach pumping lemma?
plz sir upload cfl n turing machine topic for net
sir please provide us alogrithm chapters
Sir 3:26 question 26 , I try to design E-NFA but i can't Design , So can you design E-NFA for Q26
Sir Apne Jo ye bataya (ww) ..... Jo regular nhi h to ap ek Baar 2014 ka gate ka 24 no. Qn dekhe n plz bataye answer!! Bcz qn are same but ans is given that they are regular
Superlike!!! :)
Sir 32 mein |w|=1 le lenge to
Sir in 32 example , can we say that the language is regular because the FSA of language Starting and Ending with different symbol exits
But if we give w=a.... Then the condition of "starting and ending with different symbol " is of no use... It will reject the string which should be accepted
sir 32 number example will be perhaps regular language , when language starting and ending with same symbol
32 example is not a regular language. BECAUSE the automata you build should not ignore the correct form of the language also. Your automata fails for the example L = abb ab abb. Here you see L follows the pattern wcw but your automata doesn't accept it.
Sanchit Sir ke Fans.
Regular or Not?
1) XwwY | x,y,w => (a,b)*
2) XwwY | x,y,w => (a,b)+
@KNOWLEDGE_GATE
Please answer
32 is regular agar 26 regular hua to ... kiuke lastme dono same rahta tha he to wo w= w ho raha he
32) {WCW | C,W ∈ (a,b)+} This is regular
Jis taraha question no 26 kay liyae hay '' strimg starting and ending with same symbol''
Usee thara question no. 32 kay liyae just opposite ''string starting and ending with different symbol''
For question 32
-->(q0)-----a,b----->(q1)------a,b------->((q2))
| /\
a,b |_ | Is this not a valid NFA for it?
Problem is when string is length of 2 it will accept bcz we have 2 state after parsing our string
And one of them is final state i hope you get it