Back to the 2022 paper
Similar questions
Formal Language & Automata TheoryConstruct a Moore machine which determines the residue mod 3 for each binary string treated as binary integer. And then convert into the corresponding Mealy machine.20197mFORMAL LANGUAGE & AUTOMATA THEORYThe minimum number of states required to recognize an octal number divisible by 3 is: (i) 1 (ii) 3 (iii) 5 (iv) 720222mFORMAL LANGUAGE & AUTOMATA THEORYConstruct a Moore machine equivalent to the given Mealy machine.20237mFORMAL LANGUAGE & AUTOMATA THEORYFor a given Moore machine, given input = 101010, the output would be of length: (i) |Input| + 1 (ii) |Input| (iii) |Input| − 1 (iv) Cannot be predicted20222m
PreviousFor a given Moore machine, given input = 101010, the output would be of length: (i) |Input| + 1 (ii) |Input| (iii) |Input| − 1 (iv) Cannot be predictedNextWhich of the following is a correct statement? (i) Moore machine has no accepting states. (ii) Mealy machine has accepting states. (iii) We can convert Mealy to Moore but not vice versa. (iv) All of the above