Find regular expressions for:
All binary strings with exactly two $1’s$
The set $\{a^nb^m :n\geq3, m$ is even$\}$
All binary strings with a double symbol (contains $00$ or $11$) somewhere.
The language on $\Sigma=\{a,b\}, L=\{w:n_a(w) \mod 3=0\}$
$1.L_{1}=0^{*}10^{*}10^{*}$
$2.L_{2}=aaaa^{*}\left ( bb \right )^{*}$
$3.L_{3}=\left ( 0+1 \right )^{*}00\left ( 0+1 \right )^{*}+\left ( 0+1 \right )^{*}11\left ( 0+1 \right )^{*}$
$4.L_{4}=b^{*}(ab^{*}ab^{*}ab^{*})^{*}$
L4 can also be expressed as (b + ab*ab*a)*
.........
64.3k questions
77.9k answers
244k comments
80.0k users