Back to the 2019 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYWhich 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 above20222mFORMAL LANGUAGE & AUTOMATA THEORYWhich of the following is NOT a component of a finite automaton? (i) States (ii) Input alphabet (iii) Transition function (iv) Output tape20242mFormal Language & Automata TheoryEnumerator is a Turing machine with (i) an output printer (ii) 5 input tapes (iii) a stack (iv) None of the above20212mFormal Language & Automata TheoryWrite a short note on: Multistack Turing machine20213.5m
PreviousConsider the regular expression (0+1)(0+1)\dots N \text{ times}. The minimum state FA that recognizes the language represented by this regular expression contains (i) n states (ii) (n+1) states (iii) (n+2) states (iv) None of the aboveNextLet N be an NFA with n states and let M be the minimized DFA with m states recognizing the same language. Which of the following is necessarily true? (i) m \le 2^n (ii) n \le m (iii) M has one accept state (iv) m = 2n