1 votes 1 votes Ans. B Theory of Computation theory-of-computation regular-expression finite-automata regular-language + – Na462 asked Sep 2, 2018 Na462 351 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Mk Utkarsh commented Sep 2, 2018 reply Follow Share L generates all strings with even length so B is correct 2 votes 2 votes Shaik Masthan commented Sep 2, 2018 reply Follow Share consider this question, L={1m | m=2x+3y,x,y≥0 } ====> it's regular expression is (11+111)* for your question, it is (11+1111)* = (11)* 3 votes 3 votes Please log in or register to add a comment.