Question 37 – ISRO-2007
November 7, 2023Question 1926 – Nielit STA 17-12-2017
November 7, 2023Question 1925 – Nielit STA 17-12-2017
The automaton which allows transformation to a new state without consuming any input symbols:
Correct Answer: C
Question 3 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.
We extend the class of NFAs by allowing instantaneous (ε) transitions:
1. The automaton may be allowed to change its state without reading the input symbol.
2. In diagrams, such transitions are depicted by labeling the appropriate arcs with ε.
3. Note that this does not mean that ε has become an input symbol. On the contrary, we assume that the symbol ε does not belong to any alphabet.
NFA
DFA
NFA-ɛ / NFA-l
All of the above
Subscribe
Login
0 Comments