Back to the 2019 paper
Similar questions
Formal Language & Automata TheoryDefinition 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 + 120222mFormal 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}20202mFormal Language & Automata TheoryConsider 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 above20192mFORMAL LANGUAGE & AUTOMATA THEORYA minimum state deterministic FA accepting the language: L = \{ w \mid w \in \{0,1\}^* \} where the 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 states20232m
PreviousConsider the grammar G whose SLR parser has n_1 states and LALR parser has n_2 states. What is the relation between n_1 and n_2? (i) n_1 = n_2 (ii) n_1 < n_2 (iii) n_1 > n_2 (iv) None of the aboveNextConsider 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 above
AI LearningWeb Platform
Coursify — Personal AI Course Generator
Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.