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

Подписаться 717 тыс.

Просмотров 312 тыс.

50% 1

📝 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
*********************************************************

Опубликовано:

5 окт 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 154

@KNOWLEDGEGATE_kg 9 месяцев назад

For complete Theory of Computation, check out this video: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-9kuynHcM3UA.html

@shaiksultan9051 6 лет назад

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

@santoshghorpade6370 3 года назад

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

@ShivAdiShakti108 5 лет назад

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

@dhrubotara1 7 лет назад

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.

@aratibist9365 5 лет назад

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

@abhinavs03 5 лет назад

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

@vinayak186f3 3 года назад

@@abhinavs03 superb Idea 🔥

@sameerabdullah9694 4 года назад

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

@purnima53 2 года назад

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

@KNOWLEDGEGATE_kg 2 года назад

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

@dishankadi1278 6 лет назад

sir please upload lecture on pumping lemma theorem

@abdulmuseeb5726 4 года назад

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

@harshitajain323 7 лет назад

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

@Madsaam09 3 года назад

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

@KNOWLEDGEGATE_kg 3 года назад

Thanks Madsaam!!

@swatisingh9876 5 лет назад

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

@funbiteasmr 5 лет назад

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

@vakhariyajay2224 2 года назад

Thank you very much. You are a genius.

@KNOWLEDGEGATE_kg 2 года назад

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

@PawanSharma-gs8ry 6 лет назад

Sir, you explain in hindi is so much Mindblowing

@sahilprasantachoudhury911 4 года назад

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

@tastes-like-straberries 3 года назад

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

@caroline-channing 5 лет назад

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

@yash3591 5 лет назад

Caroline Channing 😂😂

@jayativijaywargiya5764 6 лет назад

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

@bilalchandiabaloch8464 5 лет назад

Sir plz discuss using pumping lemma. Thanks in anticipation

@priyanshsharma9690 4 года назад

anticiation? LOL

@shibudhara3437 6 лет назад

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..

@sagargupta1887 6 лет назад

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

@vlogwithankit6546 3 года назад

Thankfully For better understanding

@KNOWLEDGEGATE_kg 3 года назад

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

@vlogwithankit6546 3 года назад

Sir! Make a video on pumping lemma

@nikitamalhotra5072 7 лет назад

Thanks a lot sir. Very helpful video

@rishabhshri22 6 лет назад

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 6 лет назад

It can produce epsilon with b^0

@pratiknighot7088 6 лет назад

Use NFA

@ravinderpartapsingh7792 5 лет назад

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 5 лет назад

Mr Rishabh it's NFA Representation not DFA Representation

@CookDelicious94 7 лет назад

sir please complete toc lectures as soon as possible

@hritikmandal1491 4 года назад

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 3 года назад

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

@anilshriwastava4360 4 года назад

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

@shivachauhan4747 3 года назад

Thank you sir U made it crystal clear ✌️

@KNOWLEDGEGATE_kg 3 года назад

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

@gbdhal3804 6 лет назад

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 6 лет назад

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.

@akshitarawat1970 4 года назад

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 4 года назад

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

@deeptijoshi7193 7 лет назад

awesome teaching...

@shwetapandey2406 7 лет назад

please upload more videos on toc sir...

@ishusaini8552 6 лет назад

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

@shradhajaiswal1562 6 лет назад

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

@niksdate6842 6 лет назад

Sir plz explain about pumping lemma

@govindjangid6201 4 года назад

Thanks sir ... Very well EXPLAINED 😃

@taimurkhaliq Год назад

i am so glad i understand hindi...

@bibiayesha4569 6 лет назад

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

@ZulfiqarTariqBurmi 6 лет назад

thanks for putting so much effort

@codelikeapro9724 2 года назад

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

@KNOWLEDGEGATE_kg 2 года назад

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

@bimalmarandi8860 6 лет назад

thanks for good delivery

@namaste-shorts-2004 4 года назад

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 4 года назад

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

@bhumikasaxena5322 6 лет назад

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

@priyankapradhan6042 6 лет назад

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

@mithuraveendran8699 5 лет назад

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

@PawanSharma-gs8ry 6 лет назад

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

@arunp1101 5 лет назад

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 4 года назад

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

@dip1410 6 лет назад

brilliant sir ...thank u

@jayostwal4813 6 лет назад

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 6 лет назад

I have also this same doubt ..plz clear this

@bhumikagupta1268 6 лет назад

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 6 лет назад

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

@geniusboy3037 5 лет назад

@@bhumikagupta1268 Unsubscribe t series

@nidhiverma1798 3 года назад

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

@Sarthakjaiswal-d2u Год назад

Good video air apne mera concept clear kar diya

@KNOWLEDGEGATE_kg Год назад

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

@muhammadhassaanafzal903 6 лет назад

Very helpful video

@sajalsharma4425 5 лет назад

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

@aamir1801 6 лет назад

Sir first question aur last question mein kya difference hai

@nikitasinha8181 4 года назад

Thank u so much sir 🙏

@AdeshPaul 5 лет назад

Thank you very much.

@naseerrahi7597 5 лет назад

What r various models to represent regular language

@abhijit3285 4 года назад

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

@kohli8108 Год назад

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

@hkhitter00 2 года назад

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

@taimurkhaliq Год назад

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

@hiteshgupta5092 4 года назад

Sir confused in que 1 and 8

@arunsinghiiit 2 года назад

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

@mdnadeem4288 5 лет назад

Thank you sir

@turntojobs 2 года назад

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

@Shrutiadiaggarwal 2 года назад

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

@priyankasharma1949 7 лет назад

Too gud sir thanks

@KNOWLEDGEGATE_kg 7 лет назад

thanks a lot priyanka...

@premrauth8416 4 года назад

Thankyou sir

@aradhyajain9575 5 лет назад

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

@aqsabilal7563 6 лет назад

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.

@AdeshPaul 5 лет назад

Thanks

@muhammadroshan7315 5 лет назад

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

@tinumishra7094 4 года назад

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

@SaurabhSingh-ch6nc 4 года назад

loved it !!

@tanveermahmood9422 6 лет назад

amazing

@marinag1877 6 лет назад

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

@pratyayadeepsahoo3703 5 лет назад

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

@bidyutchaki6605 4 года назад

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

@ochin33 4 года назад

Fantastic

@anshumaverma7599 5 лет назад

Superb

@ommishra7610 5 лет назад

Nice sir

@nareshpawar2692 6 лет назад

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

@uditgupta7395 7 лет назад

Awesome

@tayyabnoor6792 6 лет назад

awesome sir awesome!!!!!!!!

@aayushibansal5169 6 лет назад

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

@skv292002 4 года назад

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

@sakshimalhotra6534 5 лет назад

Sir a^n b^n ngreater than equal one

@yasirabbas3626 5 лет назад

plese upload more video on toc plese sir

@subhadeepdas9360 8 месяцев назад

Thank You Sir🙏🙏🙏🙏🙏

@KNOWLEDGEGATE_kg 8 месяцев назад

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

@narendraparmar1631 6 лет назад

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

@royfamily9273 11 месяцев назад

Thank You Sir

@KNOWLEDGEGATE_kg 11 месяцев назад

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

@prachipolakhare6440 5 лет назад

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

@sanbha1565 5 лет назад

@prachipolakhare6440 5 лет назад

@@sanbha1565 I didn't get it

@sanbha1565 5 лет назад

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

@prachipolakhare6440 5 лет назад

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

@sanbha1565 5 лет назад

@@prachipolakhare6440 all q are RL

@Dynamic.programing 6 лет назад

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

@MrCoolnk 7 лет назад

awesome

@defenceaffairs5539 Год назад

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

@abhinavrana8157 5 лет назад

1 and 2 will be Not Regular Languages

@ritikmishra6415 3 года назад

👍

@shivanipatial7255 4 года назад

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

@anoops7974 6 лет назад

English will always be best .

@nikitamalhotra5072 7 лет назад

Sir how problem 8is different from problem 1,2,3.problem 1,2,3 are also infinite. Kindly xpkain

@tanusreeghosh7484 7 лет назад

nikita anand 1,2, 3 has also infinite power but m, n, q all three are different.. That's why, while making a nfa u only need to make a loop for their given value.. M, n, q may have different values.. So machine doesn't need to remember or compare any previous value.. But in case of 8th question, value of n is equal in a, b both. So, there need of comparison occurs.. I think that's it.. I am getting this point from Sir's explanation for 8th question..