0 votes 0 votes let D= {w | w contains an even no. of a's and an odd no. of b's and does not contain the substring ab } give a DFA with Five states that recognizes D and a regular expression that generates D. Theory of Computation theory-of-computation finite-automata + – anumita asked Jun 6, 2017 anumita 3.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Let me know if i am wrong :) aehkn answered Jun 7, 2017 • selected Nov 12, 2017 by anumita aehkn comment Share Follow See all 3 Comments See all 3 3 Comments reply anumita commented Nov 12, 2017 reply Follow Share how will it accept the string "aa" ? u forgot the connecting line of that state. 0 votes 0 votes aehkn commented Nov 12, 2017 reply Follow Share question says even a's "and" odd b's and no 'ab' so there is no 'aa' in the langauage 0 votes 0 votes anumita commented Nov 12, 2017 reply Follow Share ok now i got it.. thank you so much :) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes minimal dfa will also have 5 states PRIYANSHU10 answered May 25, 2021 PRIYANSHU10 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes please correct me if I am wrong cherry348 answered Feb 12 cherry348 comment Share Follow See all 0 reply Please log in or register to add a comment.