How to identify Regular Language | Testing whether a language is regular or not | GATECSE | TOC

How to identify Regular Language || regular language or not || Testing whether a language is regular or not || identification of regular language || non regular languages in toc || how to find whether a language is regular or not || regular languages examples || irregular language || Regular and Non-Regular Language || how to check if language is regular language
Here we define what a regular language is, in that it corresponds to a DFA (deterministic finite automaton). All that is needed is for the DFA to exist, and not necessarily to give the DFA precisely. We also give some examples of regular languages that we have seen before.
1. Every finite set represents a regular language.
2. Given an expression of non-regular language, but the value of parameter is bounded by some constant, then the language is regular (means it has kind of finite comparison).
3. The pattern of strings form an A.P.(Arithmetic Progression) is regular(i.e it’s power is in form of linear expression).
Contact Details (You can follow me at)
Instagram: / thegatehub
LinkedIn: / thegatehub
Twitter: / thegatehub
...................................................................................................................
Email: [e-mail]
Website: thegatehub.com/
...................................................................................................................
📚 Subject Wise Playlist 📚
▶️Data Structures: tinyurl.com/bwp...
▶️Theory of Computation: tinyurl.com/5bh...
▶️Compiler Design: tinyurl.com/2p9...
▶️Design and Analysis of Algorithms: tinyurl.com/ywk...
▶️Graph Theory: tinyurl.com/3e8...
▶️Discrete Mathematics: tinyurl.com/y82...
▶️C Programming:tinyurl.com/255...
#RegularLanguage in Theory of Computation #RegularLanguage in Hindi #RegularLanguage Examples #RegularLanguage in Theory of Computation in Hindi #How to Identify Regular Language #Identification of Regular Language #Testing Whether a Language is Regular or Not #RegularLanguage Identification #Difference between Regular and Non-Regular Languages in Automata #Example of Regular Language #RegularLanguage,Regular,Regular Expression #Languages,Difference between Regular and Non-Regular Languages in Automata #Non-Regular Language,Regular Languages #Regular Language in Hindi #Regular Language Examples #Non-Regular Language in TOC #Non-Regular Languages #Non-Regular Languages in TOC #Example of Regular Language #How to Identify Regular Language #Non-Regular Languages in TOC #How to Check Whether a Language is CFL or Not #Identify Whether Language is CFL or Not #How to Check Whether a Language is Context-Free or Not #Language is Context-Free or Not #DCfl and CFL in TOC #Check Whether a Language is CFL or Not in Hindi #What is DCfl #Determine if a Language is Context-Free or Not #How to Check if Language is RL #DCfl, CFL, NotCfl #The GateHub #DCfl or Not DCfl, CFl or Not Cfl

[@AftabUA]

Please make a video on Pumping Lemma for regular expression

[@ramch7915]

Excellent sir..no one explained clearly like you

[@user-hs4qd2od2z]

Thank you so much sir😊

[@softtecheducation]

Really very nice sir u have a bright future 👍👍👍👍. On teaching side , your explanation without any break r confusig r hesitating, very well keep it up

[@Praveenramamoorthy]

L=a^m b^n | m+n=even ..... It is said to be regular.
There exists a functional dependency. If m=1(odd) then n= (odd) so the value of n depends on the m value ,then why it is said to be regular.
❗❗ This is not in the video. I have a doubt on this question. To clarify this i came across the video ...could somebody explain me this.

[@vaibhavpaliwal7754]

Why this is not considered as Regular ?
a^n . b^n | n>=0
we can write its Regular grammar then why is it not considered ?
Regular grammar = S = a.S.b | epsilon

[@akash_assist]

thats not regular grammar because its neither right linear nor left linear
what you have written is context free grammar.....
see the definition of regular grammar

[@aartikumari4409]

​@@akash_assistExactly

[@justintyokiasaki1491]

​@@akash_assistbut we can write regular expression corresponding to it as a*b* then why isn't it a regular language??

[@justintyokiasaki1491]

Sorry, I'm wrong, I got my answer..

[@yuvrajsharma003]

In WXW^R, if w contains a 3 length string then let, it can be start with a and end with a in W^R but what about the other char of the W are they reversed or not in W^R because this expression cannot able to tell about the a(a+b)*a + b(a+b)*b other char........

[@amaansyed3217]

was thinking the exact same thing, it's not regular grammar, he was wrong. A stack is required here.

[@KKinHD10]

Thanks sir, great video!!

[@deepjyotidas37]

very helpful content. Thank you sir

[@sandeshn527]

Tku sir🙏🙏

[@hardeepkaur6550]

Thank you sir ❤❤

[@vinayaksharma-ys3ip]

Very nice explanation Sir👍👍💯

[@ANURAGHANDA-iy7pb]

Sir ismein answer mein star ki jagah plus aayega as x and y have to take something

[@nobody-vf5ob]

Nice Video Sir

[@nobody-vf5ob]

Nice video Sir

[@ananthu4141]

13: sir why it is not regular..can you say it in english

[@LatestSongHub]

Great 👍

[@shahinakhan1205]

💯

[@shahinakhan1205]

Nice video sir g

[@athiyanavneeth7152]

Sir, wcw^r strings regular expression
Generates strings not in L which violates the property that regular expression shldnot generate strings not in L

[@nishusahu3681]

Must watch

[@somnathtiwari186]

👌👌🤘