FLAT quiz-1

The number of states in a minimal deterministic finite automation corresponding to the language

L=a^(n)|n>=4| is

• 2

• 3

• 5

• 1

Which statement is correct?

• All NFAs are DFAs.

• All NFAs are not DFAs.

• both a and b

• None of these

Which of the following cannot use Empty String transition?

• FA

• NFA

• DFA

• All of these

Dead state may be required in which of the following?

• FA

• NFA

• DFA

• All of these

When it is not fixed that with a specific input where to go next on which state, then it is called?

• DFA

• NFA

• DFSA

• None of these

What the following DFA accepts?

• x is a string such that it ends with ‘101’

• x is a string such that it ends with ‘01’

• x is a string such that it has odd 1’s and even 0’s

• x is a strings such that it has starting and ending character as 1

Which among the following states would be notated as the final state/acceptance state?

L= {xϵ∑= {a, b} | length of x is 2}

• q1

• q2

• q1, q2

• q3

What does the following figure most correctly represents?

• Final state with loop x

• Transitional state with loop x

• Initial state as well as final state with loop x

• Insufficient Data

Which of the following will not be accepted by the following DFA?

• ababaabaa

• abbbaa

• abbbaabb

• abbaabbaa

NFA, in its name has ’non-deterministic’ because of :

• The result is undetermined

• The choice of path is non-deterministic

• The state to be transited next is non-deterministic

• All of the mentioned