Which of the following is not a part of 5-tuple finite automata?

• Input alphabet

• Transition function

• Initial State

• Output Alphabet

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 of the following will not be accepted by the following DFA?

• ababaabaa

• abbbaa

• abbbaabb

• abbaabbaa

If NFA of 7 states is converted into DFA, maximum possible number of states for the DFA is ?

• 64

• 32

• 127

• 128

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