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 THEORYDesign Mealy and Moore machines to detect the sequence 1010 (overlapping allowed). Then convert the Moore machine into a Mealy machine and prove equivalence.20227mFORMAL LANGUAGE & AUTOMATA THEORYConstruct a Moore machine equivalent to the given Mealy machine.20237mFORMAL LANGUAGE & AUTOMATA THEORYThe total number of states and transitions required to form a Moore machine that produces residue mod 3 are: (i) 3 and 6 (ii) 3 and 5 (iii) 2 and 4 (iv) 2 and 520222m
PreviousThe minimum number of states required to recognize an octal number divisible by 3 is: (i) 1 (ii) 3 (iii) 5 (iv) 7NextThe total number of states and transitions required to form a Moore machine that produces residue mod 3 are: (i) 3 and 6 (ii) 3 and 5 (iii) 2 and 4 (iv) 2 and 5
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.