no matter ∑ is always finite. now as per the definition of the language, it would accept all strings having it's sufix as reverse of some prefix of any length.

now consider string abbabbabaa.. now seeing this on first sight we feel it is not in language... but have a look at the prefix a and corresponding suffix a. Reverse of a is a, so the language accepts it.

So, our problem may be broken as a language having strings that starts and ends with same symbol. this language would contains all strings in given language and reject every string that is not in given language.

And as this language is regular, hence given language is regular...:)

Antonio Anastasio Bruto da Costa@antonio 23 Jan 2017 08:35 pm

Dear @shraddhagami, understand that the key trick here is that the language is \(w~x~w^r\) and \(wx\) cannot be the empty string. Every non-empty string starts and ends with the empty string. Do you agree with this? If you do, then you will see, that for the empty string \((w = \epsilon)\) is equivalent to \((w^r = \epsilon)\). Therefore, any string between the epsilon can be matched to the pattern \(x\) and therefore, the language if studied is actually going to be the language \(L = \Sigma^+\)

@antonio You got to read the question again... w∈ ∑^{+ }so it can't be ∈. Pls read the replies above u will understand what u missed.. But still your analysis is partially correct. U approached the correct way.

Antonio Anastasio Bruto da Costa@antonio 23 Jan 2017 11:44 pm

@dashish@shraddhagami : Oh yeah, so basically that still works. Even if \(w \in \Sigma^+\), you would simply need to ensure that the beginning and ending letter is the same, which an FA (Finite Automaton) can remember to do.

As the language the starts and end with same symbol

example :w=abaXaba .

x can be anything.

so it is regular language

We can't remember the previous string in FA. then how it's possible?

@shraddhagami

what is ∑ set here??

Sry I didn't mention {a,b}

@shraddhagami

no matter ∑ is always finite. now as per the definition of the language, it would accept all strings having it's sufix as reverse of some prefix of any length.

now consider string

abbabbabaa..now seeing this on first sight we feel it is not in language... but have a look at the prefixaand corresponding suffixa.Reverse of a is a, so the language accepts it.So, our problem may be broken as a language having strings that starts and ends with same symbol. this language would contains all strings in given language and reject every string that is not in given language.

And as this language is regular, hence given language is regular...:)

Thanks dude...:)

expand x and cover everything leaving first and last symbol

a(a+b)*a +b(a+b)*bis the regular expression..Dear @shraddhagami, understand that the key trick here is that the language is \(w~x~w^r\) and \(wx\) cannot be the empty string. Every non-empty string starts and ends with the empty string. Do you agree with this? If you do, then you will see, that for the empty string \((w = \epsilon)\) is equivalent to \((w^r = \epsilon)\). Therefore, any string between the epsilon can be matched to the pattern \(x\) and therefore, the language if studied is actually going to be the language \(L = \Sigma^+\)

Thank you

Got it :)

@antonio You got to read the question again... w∈ ∑

^{+ }so it can't be∈.Pls read the replies above u will understand what u missed.. But still your analysis is partially correct. U approached the correct way.@dashish @shraddhagami : Oh yeah, so basically that still works. Even if \(w \in \Sigma^+\), you would simply need to ensure that the beginning and ending letter is the same, which an FA (Finite Automaton) can remember to do.