Back to the 2022 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYTabulate the Chomsky hierarchy of grammars with an example for each.20217mFORMAL LANGUAGE & AUTOMATA THEORYTabulate the Chomsky hierarchy of grammars with an example of each.20247mFormal Language & Automata TheoryTabulate Chomsky hierarchy of grammar with an example for each.20217mFORMAL LANGUAGE & AUTOMATA THEORYDiscuss the Chomsky hierarchy of grammars with suitable examples.20237m
PreviousLet 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^nNextConstruct the regular grammar accepting the following language: L = \{ w \in \{a, b\}^* / w \text{ is a string over } \{a, b\} \text{ such that the number of b's is } 3 \pmod 4 \}