2
$\begingroup$

For the language $\{w \mid w \in \Sigma^*, w \neq \lambda\}$, is the following regular expression correct?

$(a+b)^+$ . Which is $(a+b)$ to the power of $+$ which I think accepts all combinations of $a$ and $b$ except for the empty string.

Can someone please confirm?

  • 0
    Sorry, that was a typo. I've fixed the question except I don't know what the format is for the not equal to symbol. So, you can read that as w is not equal to the empty string.2012-10-18
  • 3
    You are correct.2012-10-18

2 Answers 2