Back to the 2022 paper
Similar questions
Formal Language & Automata TheoryIn Mealy machine, output is a function of (i) present state only (ii) next state only (iii) present state and input (iv) input only20192mFORMAL LANGUAGE & AUTOMATA THEORYConstruct a Moore machine equivalent to the given Mealy machine.20237mFORMAL 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 TheoryWhich of the following statements is/are False? A. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. B. Turing recognizable languages are closed under union and complementation. C. Turing decidable languages are closed under intersection and complementation. D. Turing recognizable languages are closed under union and intersection. (i) A and D only (ii) A and C only (iii) B only (iv) C only20212m
PreviousThe 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 5NextThe minimum number of transitions to reach the final state as per the regular expression: \{a, b\}^* baaa is: (i) 4 (ii) 5 (iii) 6 (iv) 3