# If there is comparison between two variables then language is not regular. Then how the below two languages L1 and L2 Regular? Please Explain [duplicate]

This question already has an answer here:

How these two languages be regular.If there is comparison between m and n since (n < m) is the condition to be satisfied.

## marked as duplicate by Evil, Discrete lizard♦, Raphael♦Jan 20 at 17:56

• @ArunKumarSingh, hint, both $L_1$ and $L_2$ are $\{a^t\mid t\ge 1\}$. – Apass.Jack Jan 21 at 22:51
• @ArunKumarSingh I am not saying $L_1$ is a subset of $\{a^t\mid t\ge1\}$. $L_1$ is the same as $\{a^t\mid t\ge1\}$. That is probably what tricked you. $L_2$ is $\{a^t\mid t\ge2\}$ (I was wrong saying "... and $L_2$ are $\{a^t\mid t\ge1\}$). – Apass.Jack Jan 24 at 16:05