Let L be a regular language over $\{0,1\}$. Define the reverse of the language $L$ to be the language $L^R = \{ w \in \{0,1\}^* \: \: : \: \: \text{ reverse }(w) \in L\}$, where $\text{reverse}(w)$ denotes the string $w$ ... $x$ contains an odd number of $1's$ and $00$ as a substring$\}.$ Construct a regular expression for the language $L$.
asked
Sep 18, 2018
in Theory of Computation
jothee
98 views