I'm trying to write a regular expression that defines the set of all words written in lower case characters and digits that contain a binary number.
My idea:
$(\varepsilon |[a-z]^{*})(\varepsilon |(0|1)^{*})(\varepsilon |[a-z]^{*})(\varepsilon |(0|1)^{*})$
Is my solution correct?