# Regular expression for a palindrome of finite length?

I have a language $$L = \{ww^R, w \in \{ab\}^5\}$$

I know this is a regular language because it is finite (since w can only be of length 5). I want to prove it's a regular language, so I'd create a regular expression for it.

Theoretically, my regular expression could be the union of all strings in the language, but is there a concise way to express this rather than writing all possible strings out?

• I guess you intend to write $w\in \{a,b\}^5$ (with a comma)? May 29 '20 at 21:40
• If you know that you can write a regular expression, then it is not necessary to explicitly to write it down? May 29 '20 at 21:42

Sticking $$w$$ with its reverse together usually is not a regular language and therefore there is no natural concise way to represent that using regular expressions (at least to my knowledge)