1 votes 1 votes Imarati Gupta asked Jul 21, 2016 Imarati Gupta 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes ..... LeenSharma answered Jul 21, 2016 • selected Jul 21, 2016 by Imarati Gupta LeenSharma comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Tauhin Gangwar commented Jul 21, 2016 reply Follow Share @leen in 3rd dfa on state q5 when 'b' is already defined then...then why u sent a,b,c on outgoing edge to trap state q6...u shud send only a,c from q5 to q6...not b.. 0 votes 0 votes ManojK commented Jul 21, 2016 reply Follow Share yes in 3rd too. 0 votes 0 votes LeenSharma commented Jul 21, 2016 reply Follow Share ManojK Tauhin Gangwar Thank You.check it now. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes (a+b)(a*+b*) sh!va answered Jul 21, 2016 sh!va comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes ab*c (aa+b*) sh!va answered Jul 21, 2016 sh!va comment Share Follow See all 0 reply Please log in or register to add a comment.
–1 votes –1 votes aa*b*b sh!va answered Jul 21, 2016 sh!va comment Share Follow See all 9 Comments See all 9 9 Comments reply LeenSharma commented Jul 21, 2016 reply Follow Share This is nfa not DFA. 0 votes 0 votes sh!va commented Jul 21, 2016 reply Follow Share Why sir? Which rule in DFA does not follow? Could not find.. Please help! 0 votes 0 votes sh!va commented Jul 21, 2016 reply Follow Share @LeenSharma: I think you said this is NFA because at some states , some inputs are missing, didn't you? But sir, I read somewhere.. It is not mandatory that there should be a transition for every input symbol for each state Some inputs can be omitted to implement hang / die situation and DFA rejects such strings. Please refer: http://cs.stackexchange.com/questions/12587/in-a-dfa-does-every-state-have-a-transition-on-every-symbol-of-the-alphabet Correct me if I am wrong 0 votes 0 votes LeenSharma commented Jul 21, 2016 reply Follow Share From first state for input symbol b where it will lead to? Same For last for state for input symbol where it will lead to? 0 votes 0 votes LeenSharma commented Jul 21, 2016 reply Follow Share what you said is true for NFA not for DFA. 0 votes 0 votes sh!va commented Jul 21, 2016 reply Follow Share I am confused now! Are you sure?? Did you read the link I mentioned , sir? 0 votes 0 votes sh!va commented Jul 21, 2016 reply Follow Share From wikipedia https://en.wikipedia.org/wiki/Deterministic_finite_automaton#Complete_and_incomplete_deterministic_finite_automata According to the above definition, deterministic finite automata are always complete: they define a transition for each state and each input symbol. While this is the most common definition, some authors use the term deterministic finite automaton for a slightly different notion: an automaton that defines at most one transition for each state and each input symbol; the transition function is allowed to be partial. When no transition is defined, such an automaton halts. 0 votes 0 votes LeenSharma commented Jul 21, 2016 reply Follow Share if someone ask you what is the minimum number of states in DFA for regular expression aa*b*b then what will be your answer? 3 or 4? 0 votes 0 votes shantanu kaushik commented Jul 21, 2016 reply Follow Share DFA should have transitions for all the inputs on all the states that's how it becomes deterministic 0 votes 0 votes Please log in or register to add a comment.