TOC String matching in unary aplphabet

Question

w is defined to unary alphabet

1. L={ ww }

2.L={ w w^r } ,w^r  is reverse of w

Can i say both of these are regular?

Comments

both are equivalent and regular and corresponding regular expression will be (aa)*

Answer 1

Yes we can say it is regular;

INPUT ALPHABET  {1}

Then L = { ww} can be considered as regular because it include strings like

{∈, 11, 1111,} and so on if we observe it carefully then it is of form 1^2n / n>= 0.

And similar case with L={ ww^r}

since it is like palindrome i.e. reading from end or begining seems same.