4.1 How to identify Regular Language? | Testing whether a language is regular or not! | TOC Automata

📝 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: [phone]
🟦 Telegram Updates: t.me/kg_gate
🟩 Whatsapp Updates: www.whatsapp.c...
📧 Email: [e-mail]
➡ 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
*********************************************************

[@KNOWLEDGEGATE_kg]

For complete Theory of Computation, check out this video:
th-cam.com/video/9kuynHcM3UA/w-d-xo.html

[@shaiksultan9051]

pumping lemma ke videos bhi banadijiye ....mai dusre videos dekha par meku woh samjh nai aare ...aapka explanation bahot accha h ...plz i requested u to ..pumping lemma ke topics pe bhi aap videos banaye

[@ShivAdiShakti108]

Dear Sir,
I am so grateful for your selfless efforts and dedication. Thank You for working hard for all of us. Educating billions through commendable knowledge and selfless efforts is truly a Noble cause. Keep up the great work! May god bless you :)

[@santoshghorpade6370]

sir ji , apne jindagi me itni sari padhai ki ,itni mehanat ki.....ky aaap abb happpy he ...apne jindaji se

[@tastes-like-straberries]

SIR THIS VIDEO WAS AWESOME. YOU EXPLAINED AN ENTIRE CHAPTER IN SHORT. THANK YOU!

[@dhrubotara1]

two to three times watching this video lots of tricks will definitely be found to identify regular language .in GATE exam such question will be solved within minutes.this video is really an amazing one.

[@sameerabdullah9694]

Thank you so much sir for giving all lec .
Jo bhi aap padhate he sab acche se samajh ata he

[@swatisingh9876]

sir apne to sare concept clear kar diye. hats off to you

[@Madsaam09]

Great sir....now have a good command on toc till now

[@KNOWLEDGEGATE_kg]

Thanks Madsaam!!

[@dishankadi1278]

sir please upload lecture on pumping lemma theorem

[@harshitajain323]

thanks a lot sir you made this subject really very easy to understand..plss sir keep posting further videos...best videos on toc..👍

[@vakhariyajay2224]

Thank you very much. You are a genius.

[@KNOWLEDGEGATE_kg]

You're welcome dear 😍 Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊

[@abdulmuseeb5726]

Sir please ap Pumping lema par aik video banaye.. your explanation and teaching methadology is outstanding and first class
please upload a video on Pumping lema general form

[@aratibist9365]

Sir, can you please cover the topic of Pumping lemma for regular grammar?

[@abhinavs03]

It is easy you can refer some other video and practice these questions with that.

[@vinayak186f3]

@@abhinavs03 superb Idea 🔥

[@purnima53]

socha nhi tha ke iss type ke ques solve ho jaenge...
but now I can say that surely I can... thanks sir

[@KNOWLEDGEGATE_kg]

You're most welcome dear Poonam..keep learning & supporting !! Do visit our website www.knowledgegate.in for more courses & contents !!

[@vlogwithankit6546]

Thankfully
For better understanding

[@KNOWLEDGEGATE_kg]

You're welcome.. Keep learning and supporting !!

[@vlogwithankit6546]

Sir!
Make a video on pumping lemma

[@funbiteasmr]

Difference b/w example no. 1 and example no. 8??

[@TPWNage]

i am so glad i understand hindi...

[@jayativijaywargiya5764]

Excellent work..........In so simple language ...................which is easy to understand...............thank you................

[@PawanSharma-gs8ry]

Sir, you explain in hindi is so much Mindblowing

[@sagargupta1887]

Its a wonderful ques for univ.and gate exam thx sir

[@codelikeapro9724]

thank you sir you are my inspiration...!!

[@KNOWLEDGEGATE_kg]

You're most welcome dear 😍 Keep learning & supporting, do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊

[@sahilprasantachoudhury911]

Self referential note:
If any language is finite,then it is a regular language

[@deeptijoshi7193]

awesome teaching...

[@nikitamalhotra5072]

Thanks a lot sir. Very helpful video

[@govindjangid6201]

Thanks sir ... Very well EXPLAINED 😃

[@shwetapandey2406]

please upload more videos on toc sir...

[@user-ij8dz2zg1g]

Good video air apne mera concept clear kar diya

[@KNOWLEDGEGATE_kg]

Glad to know this, keep learning & stay connected for more amazing contents👍😊

[@CookDelicious94]

sir please complete toc lectures as soon as possible

[@shivachauhan4747]

Thank you sir
U made it crystal clear ✌️

[@KNOWLEDGEGATE_kg]

Thank you so much Shradha.. Keep learning and supporting !!

[@ishusaini8552]

awesome way of teaching sir.........I salute you please upload all subjects video

[@anilshriwastava4360]

Sir ,you are great. Huge Respect and Love.Keep Blessing sir...

[@niksdate6842]

Sir plz explain about pumping lemma

[@ZulfiqarTariqBurmi]

thanks for putting so much effort

[@bimalmarandi8860]

thanks for good delivery

[@bhumikasaxena5322]

I found all these videos very helpful?
! Keep uploading sir v

[@TPWNage]

wow amazing

[@KNOWLEDGEGATE_kg]

Thanks a lot dear❤ Keep supporting & 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

[@bibiayesha4569]

Thank you so much sir. It's help a lot in net exam.....

[@AdeshPaul]

Thank you very much.

[@dip1410]

brilliant sir ...thank u

[@nidhiverma1798]

U r awesome...I also wish to become like u

[@shradhajaiswal1562]

in one and two...epsilon is to be present as 'n' can be zero

[@muhammadhassaanafzal903]

Very helpful video

[@premrauth8416]

Thankyou sir

[@abhijit3285]

Concept concept......kudos...

[@nikitasinha8181]

Thank u so much sir 🙏

[@sajalsharma4425]

sir , at 11:08 , In example 8
how can we compare the strings if the range is bounded ?
let say L = a^nb^n / 1

[@ochin33]

Fantastic

[@gbdhal3804]

Dear sir thanks for the tutorial.
I have a small doubt. hope you ll not ignore.
If I am not wrong, we design machines (here FA) for language not for a specific string. In the question 5 for each value of n we need separate machines (I can't think of a single machine to work with values from n=1 to n=10).
Correct me if I am wrong.

[@hotaru6765]

Golak Bihari Dhal watch from ~7:25 min again....
this is the technique which we can use to design a single machine for 5th question which will satisfy every criteria.

[@hritikmandal1491]

question no 1 and question number 8 dono hi to fir regular hona chahiye naa kiyunki Q8 me bhi toh order maintained ho raha hai.....

[@gauravtomar9409]

but order k sath sath number of alphabet bhi equal hain aur vo FA machine count nhin kr skti.

[@akshitarawat1970]

Sir in first diagram of this lecture.You took b when changing state. This way b will become minimum string . We can't have epsilon this way.It is not correct I think.

[@itskathan7940]

The initial state was also final, so epsilon will be accepted :)

[@bilalchandiabaloch8464]

Sir plz discuss using pumping lemma. Thanks in anticipation

[@priyanshsharma9690]

anticiation? LOL

[@honeysshorts_4118]

confusion in first second third if they are regular then why eight bcoz limit to same hai na n>=0 or m,n>=0

[@KNOWLEDGEGATE_kg]

Please join our official telegram discussion forum and put your query there. tiny.cc/telegram_kg

[@mdnadeem4288]

Thank you sir

[@kohli8108]

Sr in question 1 and 2 your are fixing permanent b and c respectively,what if we have m,n both zero

[@rishabhshri22]

Sir , I appreciate your effort .
But I think are is small mistake in Example 2 ) bcoz u can't generate string a^1 b^0 c^1 i.e. ( ac ) if m,n,q >= 0 using your DFA representation (is wrong) . According to your DFA representation condition should be m,n,q>=1 or (m,n,q>0 but not >= equal )... According to your DFA representation its not possible to generate string 'ac' .
Correct me if m wrong . :) THANKS

[@sassyjas1313]

It can produce epsilon with b^0

[@pratiknighot7088]

Use NFA

[@ravinderpartapsingh7792]

Mr Rishabh I think if u put null on the place of b that is transection between q0 and q1 then your problem will solve

[@ravinderpartapsingh7792]

Mr Rishabh it's NFA Representation not DFA Representation

[@SaurabhSingh-ch6nc]

loved it !!

[@tanveermahmood9422]

amazing

[@arunp1101]

Is the designing of 2nd question's NFA true ???
I think designed NFA will fail in case of "aaaacc" like all strings, where n=0

[@sushilmondal2219]

Keya hoga aap batiye plz.mera vi confusion hai ...

[@mithuraveendran8699]

Thanks for the video Sir. Can you please put a video explaining pumping lemma ?

[@caroline-channing]

Sir, its "whether", not "weather". Please change your video's thumbnail and title. By the way, Great Work.

[@yash3591]

Caroline Channing 😂😂

[@uditgupta7395]

Awesome

[@priyankasharma1949]

Too gud sir thanks

[@KNOWLEDGEGATE_kg]

thanks a lot priyanka...

[@AdeshPaul]

Thanks

[@tayyabnoor6792]

awesome sir awesome!!!!!!!!

[@narendraparmar1631]

Thanks sir ji😆😅😅😄😃😂😀😉😊😋😎😎

[@arunsinghiiit]

In question no. 2, let us suppose m=0, n=0, and q=1 then the output is only C how did it come by this design, I think we must put epsilon

[@anshumaverma7599]

Superb

[@turntojobs]

sir first question me m and n ki value bhi to infinite h to vo bhi infinite automata hoga na?

[@ommishra7610]

Nice sir

[@jayostwal4813]

Sir jab a ki power m and b ki power n thi vo b toh infinite thi na sir fir b vo regular language thi...But jab a ki power n and b ki power n thi tab kese Ni bani...Hum same logic use kar k iske liye b NFA design kar sakte h na..

[@pihumamma7248]

I have also this same doubt ..plz clear this

[@bhumikagupta1268]

a^m b^n : The number of a's and b's are independent of each other and need not be equal this means we can have ANY number of a's and b's so DFA can be constructed of accepting strings having any number of a's followed by any number of b's.
a^n b^n : The number and a's and b's here need to be equal that means we have to STORE the number of a's and then compare the number of b's with the number of a's but the problem is the FA does not have any such memory to store the number of a's and b's hence comparison cannot be done so dfa cannot be constructed for this language. Hence language is not Regular !
Hope that helps ! :)

[@aqsabilal7563]

Bhumika Gupta yes but that any could also be infinite... So what about that

[@geniusboy3037]

@@bhumikagupta1268 Unsubscribe t series

[@naseerrahi7597]

What r various models to represent regular language

[@priyankapradhan6042]

Thank u soooo much sir...this video helped me a lot.

[@hkhitter00]

Sir can we construct FDA for all INFINITE languages if they are regular?

[@PawanSharma-gs8ry]

Sir please Upload DAA subject video in hindi ......I hope you will be respond my request

[@shibudhara3437]

Thank u sir, i was too much board to study this subject but after seeing your video tutorial i an excited and i interested to study this subject...... Again Thank you sir..

[@Shrutiadiaggarwal]

hi sir i have an query n>=0 is mention question 1 and question 8 also same so how both languages are different on the basis of language

[@aamir1801]

Sir first question aur last question mein kya difference hai

[@subhadeepdas9360]

Thank You Sir🙏🙏🙏🙏🙏

[@KNOWLEDGEGATE_kg]

You're welcome Subhadeep, keep learning & supporting. You can also visit our website www.knowledgegate.in for more amazing videos👍

[@MrCoolnk]

awesome

[@bidyutchaki6605]

Sir in this video take question no 1 usme vhi toh m and n vhi toh greaeter than equal to 0 hai phir yeh sawal kuy regular hua......but question no 8 is not regular why...sir???plz give the answer plz

[@ritikmishra6415]

👍

[@aayushibansal5169]

sir if we use pumping lemma then grammer 5,6,7, come out to be not regular..i m a little bit confused

[@skv292002]

Pumping lemma is not guarantee of non regular language , pumping lemma is guarented for regular language always

[@aqsabilal7563]

My que is if we can't say on comparing at infinite number say '' n`'' then how can we say at a^m and a^n, since m and n could have infinite values also

[@faizahmed4103]

In case of a^m.b^n altough m,n may tend to infinity but Finite Automata can be drawn because no memory element will be required, a memory element will be required in case of a^n.b^n because no of a must be equal to no of b since Finite Automata doesn't contain a memory element therefore in this case Finite Automata can't be drawn.

[@royfamily9273]

Thank You Sir

[@KNOWLEDGEGATE_kg]

Most welcome dear! Keep learning & stay connected! You can also check out our website www.knowledgegate.in for more amazing videos & contents👍😊

[@muhammadroshan7315]

Question 1) mey bhi infinite ha aur Question 8 mey bhi. toh aik accepted aur dosra rejected kiyu ha?

[@tinumishra7094]

Kyoki 8th me a &b equal hone chaiye to uss ko yaad rakhna padega,memory use hoga par 1st me aise kuch nahi hai iss liye 1st ka FA ban jayega aur 8th ka nahi banega

[@aradhyajain9575]

language is infinite...in case of example i).ii) and iii). Still they are regular why?

[@pratyayadeepsahoo3703]

If example 1 is regular why not ex 8 becoz example 8 also has the order but dont have the finite so it is non rglr but look at ex 1 there also order is same and order is not countable and it is regular how it is possible

[@hiteshgupta5092]

Sir confused in que 1 and 8

[@nareshpawar2692]

1st and last question quit similar because both language goes to infinity but ans is different,How?????

[@akashshrestha01]

Cool

[@yasirabbas3626]

plese upload more video on toc plese sir

[@defenceaffairs5539]

first and second question me v toh range bounded ni hai where m>=0 and n>=0..........

[@shivanipatial7255]

can anyone tell me that how |w| = 4 ?

[@sakshimalhotra6534]

Sir a^n b^n ngreater than equal one

[@prachipolakhare6440]

Sir , In example 1 and 8 range is infinite then how can 1 is regular and 8 is not?

[@sanbha1565]

Q2

[@prachipolakhare6440]

@@sanbha1565 I didn't get it

[@sanbha1565]

@@prachipolakhare6440 as q no.2 also same as 1and 8.

[@prachipolakhare6440]

ohh yes but how Q1 and Q2 are RL and Q8 not?

[@sanbha1565]

@@prachipolakhare6440 all q are RL

[@Dynamic.programing]

L= {a^m b^n} m,n>=0 es mai m or n ka value kaise lenge m phle lenge 0 fr n lenge

[@kidsmasti2512]

👏

[@marinag1877]

Sir plz make videos in english for all these toc topics..

[@abhinavrana8157]

1 and 2 will be Not Regular Languages