LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
e-closure
|
|
|
e-pack
|
|
|
Q in the tuple
|
|
|
None of the mentioned
|
Detailed explanation-1: -11. 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. Explanation: The e-closure 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.
Detailed explanation-2: --closure: -closure for a given state A means a set of states which can be reached from the state A with only (null) move including the state A itself.
Detailed explanation-3: -More formally, the transition function in an NFA with -transitions has a slightly larger domain : Q × ( ∪ ) → 2Q. The -reach of a state q ∈ Q consists of all states r that satisfy one of the following conditions: 4 either r = q, 4 or r ∈ (q, ) for some state q in the -reach of q.
Detailed explanation-4: -ADVERTISEMENT. The closure(P) is a set of states which are reachable from state P on -transitions. The epsilon closure is as mentioned below − -closure (P) = P, where P ∈ Q. If there exists -closure (P) = q and (q, ) =r then, -closure (P) = q, r
Detailed explanation-5: -Is the language preserved in all the steps while eliminating epsilon transitions from a NFA? Yes, the language is preserved during the dteps of construction: L(N)=L(N1)=L(N2)=L(3).