LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
ACCEPT
|
|
|
REJECT
|
|
|
DISTINCT
|
|
|
START
|
Detailed explanation-1: -The correct answer is option 4. Option i: For every NFA with an arbitrary number of final states, there is an equivalent NFA with only one final state.
Detailed explanation-2: -Trap state in DFA If a transition goes to a state from which it can never escape. Such a state is called a trap state. It is called the dead state.
Detailed explanation-3: -Which of the following statement is true for Dead State? Explanation: It is a rejecting state for if the control enters it reaches the dead end and cannot reach an accepting state.
Detailed explanation-4: -Statement 1: Initial State of NFA is Initial State of DFA. This statement is true because when converting an NFA to a DFA, the initial state of the DFA is the epsilon closure of the initial state of the NFA.