2 votes 2 votes L1 = (0 + 11*0)* L2 = (1*0)* Explain L1 = L2 ? Theory of Computation theory-of-computation regular-expression regular-language + – hacker16 asked Dec 23, 2017 hacker16 431 views answer comment Share Follow See 1 comment See all 1 1 comment reply srivivek95 commented Dec 23, 2017 reply Follow Share Both of these language is saying that the string should not end with 1. 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes both are same see following explanation : Neeraj Mehta answered Dec 23, 2017 Neeraj Mehta comment Share Follow See all 3 Comments See all 3 3 Comments reply hacker16 commented Dec 23, 2017 reply Follow Share then should we always go for that type of problem in this manner RE->NFA->DFA->DFA(Min) Right? 0 votes 0 votes Neeraj Mehta commented Dec 23, 2017 reply Follow Share yes, this method will always give correct answer but it may take much time OR just take few strings and check if accepted by both or not. 0 votes 0 votes hacker16 commented Dec 23, 2017 reply Follow Share okay! I got it ! thanks! Neeraj Mehta 0 votes 0 votes Please log in or register to add a comment.
