0 votes 0 votes Consider the following language. L={wxwy / x,y,w €(a+b)^+} How many states are there in equivalent NFA for above L? (a) 6 (b) 7 (c) 8 (d) 9 Theory of Computation made-easy-test-series theory-of-computation finite-automata + – ROHIT SHARMA 5 asked Jul 29, 2018 • edited Mar 4, 2019 by Aditi Singh ROHIT SHARMA 5 660 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments abhishekmehta4u commented Jul 30, 2018 reply Follow Share @Arvin bro it is regular . And regular expression of shaik is right. 1 votes 1 votes arvin commented Jul 30, 2018 reply Follow Share @abhishekmehta4u yes bro i saw it i interpreted it wrong... as i was trying to prove from the both side which was wrong.. and thanks both of u 0 votes 0 votes aditi19 commented Mar 22, 2019 reply Follow Share I've a doubt @Shaik Masthan.. in the question w, x, y belongs to (a+b)+ why are you fixing the length of w to 1? w can be (a+b)+ 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Is this correct? Please correct me if im wrong. Vikas Verma answered Jul 30, 2018 Vikas Verma comment Share Follow See all 0 reply Please log in or register to add a comment.
