2 votes 2 votes DFA which accepts strings in which every 'a' is followed by a 'b' Theory of Computation finite-automata + – sumit goyal 1 asked Jan 5, 2018 sumit goyal 1 901 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply gauravkc commented Jan 5, 2018 reply Follow Share https://gateoverflow.in/128551/minimization-of-dfa 0 votes 0 votes sumit goyal 1 commented Jan 5, 2018 reply Follow Share my question is different which every 'a' is followed by a 'b' single b at end gauravkc 1 votes 1 votes gauravkc commented Jan 5, 2018 reply Follow Share Didn't get it. Can you show some strings? 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes check this one Aarti3001 answered Jan 5, 2018 Aarti3001 comment Share Follow See all 14 Comments See all 14 14 Comments reply Show 11 previous comments gauravkc commented Jan 5, 2018 reply Follow Share Oops.. forgot to show a,b loop on dead state. It is same as @Aarti3001 1 votes 1 votes LeenSharma commented Jan 5, 2018 reply Follow Share every a followed by exactly 1 'b' 1 votes 1 votes sumit goyal 1 commented Jan 5, 2018 reply Follow Share @Aarti3001 @LeenSharma yes correct dfa @gauravkc thanku 1 votes 1 votes Please log in or register to add a comment.
