Related MCQs

• If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?
• The construction time for DFA from an equivalent NFA (m number of node)is:
• Given Language L= {xϵ {a, b}*|x contains aba as its substring}Find the difference of transitions made in constructing a DFA and an equivalent NFA?
• Which of the following is correct proposition?Statement 1: Non determinism is a generalization of Determinism.Statement 2: Every DFA is automatically an NFA
• NFA, in its name has ’non-deterministic’ because of :
• Given Language: L= {ab U aba}*If X is the minimum number of states for a DFA and Y is the number of states to construct the NFA,|X-Y|=?
• Which of the following options is correct?Statement 1: Initial State of NFA is Initial State of DFA.Statement 2: The final state of DFA will be every combination of final state of NFA.
• IF_N_IS_THE_LENGTH_OF_INPUT_STRING_AND_M_IS_THE_NUMBER_OF_NODES,_THE_RUNNING_TIME_OF_DFA_IS_X_THAT_OF_NFA.FIND_X??$
• THE_CONSTRUCTION_TIME_FOR_DFA_FROM_AN_EQUIVALENT_NFA_(M_NUMBER_OF_NODE)IS:?$
• Given Language L= {x‚âà√¨¬¨¬µ {a, b}*|x contains aba as its substring?#