1 votes 1 votes What is the regular expression of $L = \{ s \in L$ $i$ = no of $1$ in string $s$ $j$ = no of $0$ in string $s$ $i+j$ is odd $\}$ ??? Theory of Computation regular-expression theory-of-computation finite-automata regular-language + – Dharmesh Gusai asked Mar 4, 2018 • edited Mar 16, 2018 by Sukanya Das Dharmesh Gusai 365 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Mk Utkarsh commented Mar 4, 2018 reply Follow Share $\left ( 0+1 \right )\left ( 00+01+10+11 \right )^{*}$ 1 votes 1 votes guptashekhar54 commented Jul 16, 2018 reply Follow Share (a(bb)* + b(aa)*)* 0 votes 0 votes Please log in or register to add a comment.