Definition of a language L with alphabet \{a\} is given as L= \{a^{nk}

Back to the 2022 paper

Module 1: Introduction, Regular languages and finite automata

20222m

Definition of a language $L$ with alphabet $\{a\}$ is given as $L= \{a^{nk} / k > 0, \text{ and } n \text{ is a positive integer constant}\}$ . What is the minimum number of states needed in a DFA to recognize L?
(i) $k + 1$
(ii) $n + 1$
(iii) $2n + 1$
(iv) $2k + 1$

This question has repeated before

Also appeared in 2020.

Search Google Ask AI

Similar questions

Formal Language & Automata TheoryDefinition of a language L with alphabet \{a\} is given as L = \{a^{nk} \mid k > 0, \text{ and } n \text{ is a positive integer constant}\} What is the minimum number of states needed in a DFA to recognize L? (i) k + 1 (ii) n + 1 (iii) 2^{n + 1} (iv) 2^{k + 1}20202m Formal 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 = 2n20192m FORMAL 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^n20212m FORMAL 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^n20232m

PreviousThe 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 these NextA ___________ is context free grammar with atmost one non-terminal in the right handside of the production. (i) linear grammar (ii) linear bounded grammar (iii) regular grammar (iv) None of the above