Regular Languages

TOC: Regular Languages in Theory of Computation.
Topics Discussed:
1. Regular Languages in TOC.
2. Non-Regular Languages in TOC.
3. Examples of languages which are not regular.

Music:
Axol x Alex Skrindo - You [NCS Release]

#TheoryOfComputation #TOCByNeso #RegularLanguages #AutomataTheory

[BossLikesShenanigans]

Why is the first example not a regular language? If the language just consists of one string then can't you just have all the states of the machine be Q ={a, ab, abb...} and then the transition function for each state would be whether the next symbol is seen, and if it isn't, we send the machine to a dead state?

EDIT: I just saw your reply to a different comment. I didn't understand the example. For those wondering the example was about whether it can detect if a string repeated itself.

[Bananainacar]

Wonderful video! Everything is explained in such a clear and efficient way. You're the best.

[hectorg]

I freaken love you and this channel for this content!

[shavkat]

the first example can be modelled in a FSM. First u make a tree structured DFM with 'a' for left and 'b' for right. then wherever u end up at the fifth character, u continue accordingly.

[cindychaba]

Amazing content.Keep up the good work.

[nguyentuananhphan]

Thank you sir for your clear explanation, this series really saves me!!! God bless you!

[KiimzB]

This was such a good video. Very clear. Thank you

[Oneminutecover-dxre]

Don't get how FSM can't store strings when in the previous lectures of DSM we transfer all string to next state(or that's how I understood it )

[vipinsclasses]

i like your lectures, brother. you got one more subscriber.

[azeemqureshi]

wow what a nice video you made very clear and very easy...

[zerobit]

To be clear.

Let S to be a string. We could have DFA to recognize S* just simply by loop to the beginning after a full match. What Neso mean is just that we could not have a DFA to find a arbitrary S's repetition. To recognize a specific string's repetition is a different story with arbitrary string's repetition!!!

[pailguy]

The first Eg. (ababbababb) repeats only 2 times, so without saving it we can simply construct a DFA that gets all inputs as a sequence of alphabets. In this case isn't it regular language?

[ijazkhans]

The expression ( ababbababb ) that you discussed earlier in this lecture is regular expression and you say: it's not a regular

[elevated_existence]

By the way is a language over {a, b} that contains aabb in itself regular or not

[naseerrahi]

What r various models to represent regular language

[limishavyas]

costruct regular grammer for language is avalible or

[miro-hristov]

You said that a language is regular if it can be recognized by FSM. RegEx has a lot of modifiers that allow it to count repetition or use memory. Eg. "{2}" is a quantifier - Match 2 of the preceding token. Or "\1" is Backreference - matches the result of capture group #1. Does that make Regular Expressions not a regular language? I'm a little confused...

[stefanwullems]

I'm missing the explaination why finite state automata cannot count or store strings. Maybe an example where we try to build a fsm that tries process these langages but fails would have been useful.

[hakanyalcn]

can you explain that why ababbababb is not recognizing with FSM ? i can create ababbababb by using 10 state(one state point to dead conditions) simply.

[Alkis]

A video of what is regular language that shows examples only of non-regular languages. Don't you think it would be a good idea to illustrate that regular language is?