2 votes 2 votes WHat is the union of the following wo languages L=0*1+0+1* ∪ 10*1 L=001 U 0*1* Theory of Computation theory-of-computation + – Dulqar asked Feb 3, 2017 Dulqar 399 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply srestha commented Feb 4, 2017 reply Follow Share 1) 0*1+0*1* 2) 0*1* 0 votes 0 votes Ritesh Singh commented Feb 4, 2017 reply Follow Share sorry but first of ur answer is wrong bcz ur result of union can generate 011 but when u see the above 1st question u find it is disappeared 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Steps to find union of two regular languages is construct the DFA of both regular expression Find the union of both DFA's find the resultant regular expression The answer for above question is A.100*1 B.001 Deepthi_ts answered Apr 11, 2017 Deepthi_ts comment Share Follow See all 3 Comments See all 3 3 Comments reply Prashant. commented Apr 11, 2017 reply Follow Share Correct it 0*1+0*(01* +1) 0*1* 0 votes 0 votes Deepthi_ts commented Apr 11, 2017 reply Follow Share please let me know the procedure 0 votes 0 votes Prashant. commented Apr 11, 2017 reply Follow Share try to get every string, start with minimum one i.e. for 1st one 10, 11 etc. 0 votes 0 votes Please log in or register to add a comment.