Question

Prove that, for any alphabet, l denotes the set of palindromes.

Answer 1

$\mathfrak{The\:Answer\:is}$


Palindrome is a set of numbers which on reversing appear same as the initial one...

Is is denoted by 'I'...

Therefore...

I = Any Palindrome Number

$\boxed{Hope\:This\:Helps}$

Answer 2

Here's ur answer

Firstly I pick a language xyz where x=ϵ, y=(abb)k, z=(bba)k where |y|≥ the number of states in the automaton representing my language. Then xyz=(abb)k(bba)k is a palindrome.

Now I split y into uvw, where v≠ϵ contains a state visited more than once. If the language is regular then xuviwz is within the language ∀i≥0.

I choose i=2, then uv2w=(abb)n where n>k.

Then xuv2wz=(abb)n(bba)k where n>k, which is not a palindrome.

Firstly, is my reasoning for this particular proof correct? I'm unsure about how to properly apply the pumping lemma to this problem. And secondly the question asks me to state a proof for palindromes in general, whereas I only attempted to prove it for a single case. Is there an example I can choose which proves the conjecture for all palindromes? I assume not, seeing as I can't think of how that could be represented using regular expressions

Hope it'll help
plz plz mark my answer as brainliest plz