Back to the 2024 paper
Similar questions
FORMAL 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 THEORYWhich of the following is a regular language? (i) Strings whose length is a sequence of prime numbers (ii) Palindrome strings (iii) Strings containing substring ww^r (iv) Strings with even number of 0’s20242mFORMAL LANGUAGE & AUTOMATA THEORYShow that the language: L = \{ a^{n^2} b^n \mid n \ge 0 \} is not regular.20227mFORMAL LANGUAGE & AUTOMATA THEORYUse the pumping lemma to prove that the language L = \{a^n b^n : n \ge 1\} is not regular.20257m
PreviousWhich of the following problems is undecidable? (i) DFA acceptance (ii) NFA acceptance (iii) The Halting Problem (iv) Regular expression matchingNextWhich of the following is a PDA? (i) Finite automaton with a stack (ii) Turing machine with a stack (iii) Finite automaton with a queue (iv) Turing machine with a queue