Back to the 2025 paper
Similar questions
Formal Language & Automata TheoryWhich of the following is the smallest unit in the definition of a language? (i) Grammar (ii) Alphabet (iii) String (iv) Production20252mFORMAL LANGUAGE & AUTOMATA THEORYWhich of the following languages is NOT regular? (i) {a^n b^n | n \ge 0} (ii) {a, b}* (iii) Finite languages (iv) Languages accepted by DFA20252mFORMAL LANGUAGE & AUTOMATA THEORYA language is said to be recursively enumerable if it is accepted by a (i) DFA (ii) Turing Machine (iii) PDA (iv) Linear Bounded Automaton20252mFORMAL LANGUAGE & AUTOMATA THEORYWhich of these represents a regular language? (i) \{ a^n b^n \mid n \ge 0 \} (ii) Strings with equal number of a’s and b’s (iii) \{ a^n \mid n \text{ is prime} \} (iv) \{ w \mid w \text{ starts with 'a' and ends with 'b'} \}20242m
PreviousWhich of the following is the smallest unit in the definition of a language? (i) Grammar (ii) Alphabet (iii) String (iv) ProductionNextWhich grammar type is the most powerful? (i) Type-0 (ii) Type-1 (iii) Type-2 (iv) Type-3
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.