Statement 1: Mealy machine reacts faster to inputs. The major difference between Mealy and Moore machine is about:Įxplanation: Mealy and Moore machine vary over how the outputs depends on prior one (transitions) and on the latter one(states).Ĥ8. Mealy and Moore machine can be categorized as:Įxplanation: They are collectively known as Transducers.Ĥ7. The O/P of Mealy machine can be represented in the following format:Įxplanation: The output of mealy machine depends on the present state as well as the input to that state.Ĥ5.The ratio of number of input to the number of output in a mealy machine can be given as:Įxplanation: The number of output here follows the transitions in place of states as in Moore machine.Ĥ6. In mealy machine, the O/P depends upon?Įxplanation: Definition of Mealy Machine.Įxplanation: Finite Automaton with Output has a common definition for both the categories.Ĥ4. Start your Programming Journey with Python Programming which is Easy to Learn and Highly in DemandĤ1. Finite machines with output have no accepting states and can be converted within each other. Which of the following is a correct statement?Ĭ) We can convert Mealy to Moore but not vice versaĮxplanation: Statement a and b is correct while c is false. The O/P of Moore machine can be represented in the following format:Įxplanation: Op(t)=δ(Op(t)) is the defined definition of how the output is received on giving a specific input to Moore machine.Ĥ0. output alphabet as these are finite machines with output.ģ9. The output alphabet can be represented as:Įxplanation: Source-The tuple definition of Moore and mealy machine comprises one new member i.e. (INPUT: abaaab)Įxplanation: The outputs are as per the input, produced.ģ8. Given Language L= is taken as input and it prints 1 as an output “for every occurrence of a, b as its substring. Statement 2: Every DFA is automatically an NFAĪ) Statement 1 is correct because Statement 2 is correctī) Statement 2 is correct because Statement 2 is correctĬ) Statement 2 is false and Statement 1 is falseĭ) Statement 1 is false because Statement 2 is falseĮxplanation: DFA is a specific case of NFA.Ģ7. Statement 1: Non determinism is a generalization of Determinism. 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.