Which of the following is correct proposition? NFA, in its name has ’non-deterministic’ because of :ī) The choice of path is non-deterministicĬ) The state to be transited next is non-deterministicĮxplanation: Non deterministic or deterministic depends upon the definite path defined for the transition from one state to another or undefined(multiple paths).Ģ6. If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?Įxplanation: The maximum number of sets for DFA converted from NFA would be not greater than 2n.Ģ5. An automaton that presents output based on previous state or current input:Įxplanation: A transducer is an automaton that produces an output on the basis of what input has been given currently or previous state.Ģ4. If X is the minimum number of states for a DFA and Y is the number of states to construct the NFA,Įxplanation: Construct the DFA and NFA individually, and the attain the difference of states.Ģ3. A DFA cannot be represented in the following formatĮxplanation: A DFA can be represented in the following formats: Transition Graph, Transition Table, Transition tree/forest/Any programming Language.Ĭ) Same number of states as well as transitionsĮxplanation: Two states are said to be equivalent if and only if they have same number of states as well as transitions.Įxplanation: Statement 1 and 2 always true for a given Language. A Language for which no DFA exist is a_Įxplanation: A language for which there is no existence of a deterministic finite automata is always Non Regular and methods like Pumping Lemma can be used to prove the same.ġ3.
Which of the following not an example Bounded Information?Ĭ) colour of the traffic light at the momentĮxplanation: Bounded information refers to one whose output is limited and it cannot be said what were the recorded outputs previously until memorized.ġ2.
Prepare for Aptitude with 50+ Videos Lectures and Handmade Notesġ1.
0 kommentar(er)
