0 votes 0 votes GIve a DFA that accepts the following language : L(ab(a+ab)*(a+aa)) What could be the minimum number of states in such DFA? Theory of Computation theory-of-computation regular-expression finite-automata + – Ayush Upadhyaya asked Mar 12, 2017 Ayush Upadhyaya 637 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes 5 states sh!va answered Mar 13, 2017 selected Mar 14, 2017 by 2018 sh!va comment Share Follow See 1 comment See all 1 1 comment reply Ayush Upadhyaya commented Mar 14, 2017 reply Follow Share Yeah, the same DFA is what I got 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 6 states are required RAJESHWAR YADAV answered Mar 12, 2017 RAJESHWAR YADAV comment Share Follow See all 3 Comments See all 3 3 Comments reply Ayush Upadhyaya commented Mar 12, 2017 reply Follow Share Please show the DFA.I am getting 5 states 0 votes 0 votes Kaluti commented Mar 12, 2017 reply Follow Share I am also getting 5 states 0 votes 0 votes Ayush Upadhyaya commented Mar 13, 2017 reply Follow Share Please share the dfa 0 votes 0 votes Please log in or register to add a comment.