Question: is palindrome a regular language?
Answer: Palindromes are not regular: It is easy to prove it using pumping lemma. ... Let us assume a language L which is palindrome so L can be expressed as x. xR where xR is reverse of x. If x is a regular language then xR will be too and hence the palindrome will be regular.