Back to the 2024 paper
Similar questions
Formal Language & Automata TheoryThe Halting Problem is (i) Decidable (ii) Undecidable (iii) Context-Free (iv) Regular20252m Compiler DesignWhich automaton accepts regular languages? (i) PDA (ii) DFA (iii) Turing machine (iv) LBA20252m Compiler DesignChoose the correct option / answer the following: Which of the following is NOT accepted by finite automata? (i) Palindromes (ii) Strings with even number of a's (iii) Binary strings divisible by 3 (iv) Strings ending with 'ab'20242mFormal Language & Automata TheoryA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20202m
PreviousA Turing Machine has: (i) A finite tape (ii) An infinite tape (iii) A stack (iv) A queueNextWhich 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'} \}