Test: Uses of Epsilon-Transitions - Computer Science Engineering (CSE) MCQ

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

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

: 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.

The languages which are recognized by an epsilon Non deterministic automata are closed under the following operations:
a) Union
b) Intersection
c) Concatenation
d) Negation
e) Star
f) Kleene closure

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

Correct Answer :- A

Explanation : An e-NFA consist of 5 tuples: A=(Q, S, d, q0, F)

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

Note: e is never a member of S.

e-NFA do come up with a convenient feature but nothing new.They do not extend the class of languages that can be represented.