I have a language with the letters {a,b}. The words are made of lambda, aaa, bb. How can I determine if it is a regular language using a regular expression?
