Find a regular expression to describe the given language Lam

Find a regular expression to describe the given language: {Lambda, a, b, c, aa, bb, cc, ..., a^n, b^n, c^n, ...}

Solution

Regular expression:

(a*+b*+c*)

Where,

* represents any number of sequence and + means either of them.

So, the language generated by this regular expression is:

{^, a, b, c, aa, bb, cc, ..... aⁿ, bⁿ, cⁿ,...}