COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
reachable state
|
|
|
initial state
|
|
|
final state
|
|
|
-reachable state
|
Detailed explanation-1: -The epsilon closure E(q) of a state q in Q is the union of the set q with the set of all states that can be reached from q via one or more transitions. If R is a set of states from Q, the epsilon closure E(R) is defined as the union of the epsilon closures of all the states in R.
Detailed explanation-2: -Unreachable states are the states that are not reachable from the initial state of the DFA, for any input string. These states can be removed. Dead states are the states from which no final state is reachable. These states can be removed unless the automaton is required to be complete.
Detailed explanation-3: --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-4: -Explanation: -closure is defined as the set of states being reached through -transitions from a starting state.