2 votes 2 votes Consider the Following regular expressions r1 = 1(0 + 1)* r2 = 1(1 + 0)+ r3 = 11*0 What is the relation between the languages generated by the regular expressions above ? a) L (r1) ⊆ L (r2) and L(r1) ⊆ L(r3) b) L (r1) ⊇ L (r2) and L(r2) ⊇ L(r3) c) L (r1) ⊇ L (r2) and L(r2) ⊆ L(r3) d) L (r1) ⊇ L (r3) and L(r2) ⊆ L(r1) Also Please tell explain the value of 1(1 + 0)+ . Theory of Computation theory-of-computation finite-automata regular-expression grammar + – Utkarsh Anand asked Jul 26, 2017 Utkarsh Anand 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Option (b) and (d) both seem correct because r1 can generate r2 and r3 and r2 can generate r3 1(1 + 0)+ means at least minimum string contain 11 or 10 where string always start with (1) and in (1 + 0)+ means except {ε} Epsilon you can find anything learner_geek answered Jul 26, 2017 learner_geek comment Share Follow See 1 comment See all 1 1 comment reply Nikhil Patil commented Jun 10, 2018 reply Follow Share i agree B) and D) both are correct ! 0 votes 0 votes Please log in or register to add a comment.
