1. Complement of a DFA can be obtained by:
a. making starting state as final state.
b. no trival method.
c. making final states non-final and non-final to final.
d. make final as a starting state.
Ans- c. making final states non-final and non-final to final.
2. Regular sets are closed under union concatenation and Kleene closure.
a. TRUE
b. FALSE
c. Depends on regular set
d. Can't say
Ans- a. TRUE
3. The number of final states we need as per the given language? Language L: {an| n is even or divisible by 3}
a. 1
b. 2
c. 3
d. 4
Ans- b. 2
4. Which of the following does not belong to input alphabet if S={a, b}* for any language?
a. a
b. b
c. e
d. None of the mentioned
Ans- c. e
5. An e-NFA is _____ in representation.
a. Quadruple
b. Quintuple
c. Triple
d. None of the mentioned
Ans- b. Quintuple
6. The automaton which allows transformation to a new state without consuming any input symbols:
a. NFA
b. DFA
c. NFA-l
d. All of the mentioned
Ans- c. NFA-l
7. e-transitions are:
a. conditional
b. unconditional
c. input dependent
d. None of the mentioned
Ans- b. unconditional
8. The ____ of a set of states, P, of an NFA is defined as the set of states reachable from any state in P following e-transitions.
a. e-closure
b. e-pack
c. Q in the tuple
d. None of the mentioned
Ans- a. e-closure
9. The e-NFA recognizable languages are not closed under :
a. Union
b. Negation
c. Kleene Closure
d. None of the mentioned
Ans- d. None of the mentioned