0 votes 0 votes closed as a duplicate of: #theory of computation #DFA #NFA 5. Consider r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively: (a) N – 3, D – 4 (b) N – 3, D – 3 (c) N – 3, D – 3 (d) N – 4, D – 4 Theory of Computation theory-of-computation regular-expression finite-automata regular-language + – Shashi Shekhar 1 asked Sep 3, 2017 • closed Sep 3, 2017 by LeenSharma Shashi Shekhar 1 850 views comment Share Follow See all 3 Comments See all 3 3 Comments reply LeenSharma commented Sep 3, 2017 reply Follow Share https://gateoverflow.in/1291/gate2006-34 0 votes 0 votes prakashsingh commented Sep 3, 2017 reply Follow Share NFA and DFA both will have the same number of states. The no of 1's that will be accepted by this are : {0,2,3,4...so on}. So the correct ans should be c. 0 votes 0 votes stdntlfe commented Sep 23, 2017 reply Follow Share (A) N=3,D=4 0 votes 0 votes Please log in or register to add a comment.