0 votes 0 votes With Σ = {a,b}, give a dfa for L= w1aw2 :|w1|≥ 3,|w2|≤ 5 Theory of Computation theory-of-computation finite-automata + – Shubham Pande asked Jun 29, 2017 Shubham Pande 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes L = {W1aW2 | W1>=3 and W2<=5} Akash Mittal answered Jun 29, 2017 Akash Mittal comment Share Follow See all 4 Comments See all 4 4 Comments reply Shubham Pande commented Jun 29, 2017 reply Follow Share It doesnt say that w2 doesnt contain a's but with your dfa no language with w2 containing a's will get accepted.i think some modification is required 0 votes 0 votes Akash Mittal commented Jun 30, 2017 reply Follow Share after 'a' there should be atmost 5 b's..if 'a' is coming in W2 that will be merge to 'W1a' 0 votes 0 votes ANJALI SAWARKAR commented Jul 27, 2017 reply Follow Share here they didn't say that you should not have 'a' 's in w2 so how can we merge it?? 0 votes 0 votes pallaviamu commented Apr 16, 2018 reply Follow Share You can try all strings belonging to L are getting accepted!!!!!!! 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes verify both valid string they are accepted and also verify that invalid string that is not getting accepted. ANJALI SAWARKAR answered Jul 29, 2017 ANJALI SAWARKAR comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The DFA will be Sambit Kumar answered Apr 16, 2018 • edited Apr 16, 2018 by Sambit Kumar Sambit Kumar comment Share Follow See all 0 reply Please log in or register to add a comment.