0 votes 0 votes Is there is any good method or procedure to solve this question? or else I have to try by brute force ,,,like try 1st 0,1,2,3... length string Daniyal89 asked Sep 18, 2018 Daniyal89 339 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Verma Ashish commented Sep 18, 2018 reply Follow Share Bro i don't think that there is any good and fast method...better to go with trial approach. :) We can think about any approach if regular expressions are small. 0 votes 0 votes Daniyal89 commented Sep 18, 2018 reply Follow Share thank u @verma 0 votes 0 votes Magma commented Sep 18, 2018 reply Follow Share 100 can't be member of L(R1) and L(R2) therefore , shortest length : 3 Is it right ??? 0 votes 0 votes Verma Ashish commented Sep 18, 2018 reply Follow Share Yes..you are right. Are you tried any different approach ? 0 votes 0 votes Magma commented Sep 18, 2018 reply Follow Share No no same brute force...I just check whether my answer is correct or not 0 votes 0 votes Daniyal89 commented Sep 19, 2018 reply Follow Share @Magma u r right 0 votes 0 votes Hira Thakur commented Sep 19, 2018 reply Follow Share how many no of states in regular expression R1??? 0 votes 0 votes Please log in or register to add a comment.