1 votes 1 votes Let language defined is { Number of a's =2 and length of string is atleast 3} over alphabet {a,b}.What are number of states in minimal DFA? Theory of Computation theory-of-computation minimal-state-automata finite-automata + – rahul sharma 5 asked Aug 6, 2017 rahul sharma 5 894 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes 7 ?? i think it is correct DFA for above language.. joshi_nitish answered Aug 6, 2017 • selected Aug 14, 2017 by Praveen Saini joshi_nitish comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Aug 6, 2017 reply Follow Share your dfa is rejecting 'baa' which is in language... 0 votes 0 votes mohit kumar 5 commented Aug 8, 2017 reply Follow Share 7 states 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes i think ans should be 7 states, MFA will be as given below with slight modification..please correct me if i wrong.. Keval Kubavat answered Aug 10, 2017 • edited Aug 10, 2017 by Keval Kubavat Keval Kubavat comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Aug 10, 2017 reply Follow Share your dfa is accepting "bbb" which is not in language. 0 votes 0 votes Keval Kubavat commented Aug 10, 2017 reply Follow Share updated.. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L is defined as No. of a = 2 and |w| >= 3 over Σ = {a,b} L = { aab,aba, baa, aabb, abab, baba, ........} So, Number of states in minimal DFA is 4. dekabh answered Aug 14, 2017 • edited Aug 14, 2017 by dekabh dekabh comment Share Follow See 1 comment See all 1 1 comment reply rahul sharma 5 commented Aug 14, 2017 reply Follow Share aa is accepted which is not in the Language 0 votes 0 votes Please log in or register to add a comment.
