Automata Theory Questions and Answers – Uses of Epsilon-Transitions

«
»

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Uses of Epsilon-Transitions”.

1. 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
View Answer

Answer: c
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.
advertisement

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

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

3. 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
View Answer

Answer: a
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.
Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!
advertisement
advertisement

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

Answer: d
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. Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
a) yes
b) no
View Answer

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

6. An e-NFA is ___________ in representation.
a) Quadruple
b) Quintuple
c) Triple
d) None of the mentioned
View Answer

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

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

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

Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice Questions and Answers.

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & technical discussions at Telegram SanfoundryClasses.