Test: Uses of Epsilon-Transitions


7 Questions MCQ Test Theory of Computation | Test: Uses of Epsilon-Transitions


Description
This mock test of Test: Uses of Epsilon-Transitions for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 7 Multiple Choice Questions for Computer Science Engineering (CSE) Test: Uses of Epsilon-Transitions (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Uses of Epsilon-Transitions quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Uses of Epsilon-Transitions exercise for a better result in the exam. You can find other Test: Uses of Epsilon-Transitions extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

The automaton which allows transformation to a new state without consuming any input symbols:

Solution:

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

QUESTION: 2

e-transitions are

Solution:

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

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

Solution:

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

QUESTION: 4

he e-NFA recognizable languages are not closed under :

Solution:

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

QUESTION: 5

 Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?

Solution:

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

QUESTION: 6

 An e-NFA is ___________ in representation.

Solution:

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.

QUESTION: 7

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

Solution:

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

Similar Content

Related tests