187 views
2 votes
2 votes

Consider the following DFA
image:image1.png
Minimum number of states required to construct an equivalent NFA is ?

(A) 4

(B) 5

(C) 3

(D) 6

In the above question the solution provided is that it is a DFA that accepts all the strings containing at most two 1’s.. When we have not been provided any information about any state being final or initial state, how are we supposed to proceed ??

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
Kushagra1234 asked Oct 12, 2018
146 views
the data structure which is most suitable for permuting a set of integers is1)queue 2) stack 3)circular queue4) 2x2 arraythe ans given circular queue.i want explanation
6 votes
6 votes
2 answers
3
Chhotu asked Nov 22, 2017
394 views
Refer check selected answer comments of https://gateoverflow.in/1995/gate2014-2-36.
2 votes
2 votes
1 answer
4
JeetRabari asked Nov 13, 2018
2,687 views
Find the limit of the given expression$\lim_{x\to\frac{\pi}{2}}\left ( \sec x-\frac{1}{1-\sin x} \right )$