Back to the 2021 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYThe construction time for DFA from NFA with m nodes is: (i) O(m^2) (ii) O(2^m) (iii) O(m) (iv) O(\log m)20212mFormal Language & Automata TheoryThe maximum number of states of a DFA converted from an NFA with n states is (i) n (ii) n^2 (iii) 2^n (iv) None of the above20212mFORMAL LANGUAGE & AUTOMATA THEORYFor an NFA with n states, the minimized DFA has: (i) m \le 2^n (ii) n \le m (iii) one accept state (iv) m = 2^n20212mFormal Language & Automata TheoryLet 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 = 2^n20212m
PreviousA minimum state deterministic FA accepting the language L = \{w \mid w \in \{0, 1\}^*\} where number of 0's and 1's in w are divisible by 3 and 5 respectively, has (i) 15 states (ii) 11 states (iii) 10 states (iv) 9 statesNextTabulate Chomsky hierarchy of grammar with an example for each.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.