Engineering Questions with Answers - Multiple Choice Questions

# MCQs on Uses of Epsilon-Transitions

1 - Question

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

Explanation: NFA-l or e-NFA is an extension of Non deterministic Finite Automata which are usually called NFA with epsilon moves or lambda transitions.

2 - Question

e-transitions are
a) conditional
b) unconditional
c) input dependent
d) none of the mentioned

Explanation: An epsilon move is a transition from one state to another that doesn’t require any specific condition.

3 - Question

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

Explanation: The e-closure of a set of states, P, of an NFAis defined as the set of states reachable from any state in P following e-transitions.

4 - Question

The e-NFA recognizable languages are not closed under ___________
a) Union
b) Negation
c) Kleene Closure
d) None of the mentioned

Explanation: The languages which are recognized by an epsilon Non deterministic automata are closed under the following operations:
i) Union
ii) Intersection
iii) Concatenation
iv) Negation
v) Star
vi) Kleene closure

5 - Question

Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
a) yes
b) no

Explanation: Yes, the language is preserved during the dteps of construction: L(N)=L(N1)=L(N2)=L(3).

6 - Question

An e-NFA is ___________ in representation.
b) Quintuple
c) Triple
d) None of the mentioned

Explanation: An e-NFA consist of 5 tuples: A=(Q, S, d, q0, F)
Note: e is never a member of S.

7 - Question

State true or false:
Statement: Both NFA and e-NFA recognize exactly the same languages.
a) true
b) false