0 votes 0 votes Prove rigorously that the expressions in $r= (1^*011^*)^* (0 + λ) + 1^* (0 + λ)$ do indeed denote the specified language. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-expression + – Naveen Kumar 3 asked Apr 2, 2019 Naveen Kumar 3 191 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.