Which of the following describes the dead state (sink state) in a Deterministic Finite Automaton (DFA)?
Option A is correct. Which of the following describes the dead state (sink state) in a Deterministic Finite Automaton (DFA)? Answer: A non-final state from which there is no transition to any final state for any input symbol.
What is the minimum number of states required in a DFA to accept the language L = { w ∈ {0, 1}* | w contains '101' as a substring }?
Option B is correct. What is the minimum number of states required in a DFA to accept the language L = { w ∈ {0, 1}* | w contains '101' as a substring }? Answer: 4 states.
In the state subset construction (power set construction) converting an NFA with 'n' states to an equivalent DFA, what is the maximum theoretical number of states in the resulting DFA?
Option A is correct. In the state subset construction (power set construction) converting an NFA with 'n' states to an equivalent DFA, what is the maximum theoretical number of states in the resulting DFA? Answer: 2ⁿ states.
Which theorem provides a necessary and sufficient condition for a language to be regular based on the index of its right-invariant equivalence relation?
Option B is correct. Which theorem provides a necessary and sufficient condition for a language to be regular based on the index of its right-invariant equivalence relation? Answer: Myhill-Nerode Theorem.
What is the result of Arden's Theorem for the regular equation R = Q + RP, where P does not contain the null string ($\epsilon )$?
Option B is correct. What is the result of Arden's Theorem for the regular equation R = Q + RP, where P does not contain the null string ($\epsilon )$? Answer: R = QP*.