Can anyone help me with this question: I know it before, but I have tried to solve it myself and didnt succeed.
what is the regular expression for this language: L=all words that have 00 or 11 but not ...

i am going through some past exam paper questions on regular languages for some revision, and i am having a bit of trouble with converting general ideas into formal mathematical proofs.
the question ...

Draw a finite state machine which will accept the regular expression:
$(a^2)^* + (b^3)^*$
In particular, I am confused by the $+$ sign, what does it exactly mean? Most literature I could find about ...

Given the alphabet $\Sigma=\{a, b\}$ and for the next Language $L=\{w:|w|_a=2^n+273\text{ for }n\in \mathbb{N}\}$ determine whether the language is regular.
Firstly, I think this language is regular.
...