Chomsky Hierarchy and Automata Theory MCQs December 19, 2025December 14, 2024 by u930973931_answers 30 min Score: 0 Attempted: 0/30 Subscribe 1. Which type of grammar is Type 0 in the Chomsky hierarchy? (A) Unrestricted grammar (B) Context-sensitive grammar (C) Regular grammar (D) Context-free grammar 2. Which automaton recognizes Type 3 languages (regular languages)? (A) Turing Machine (B) Finite Automaton (C) Pushdown Automaton (D) Linear Bounded Automaton 3. What is a Type 2 grammar in the Chomsky hierarchy? (A) Unrestricted grammar (B) Context-sensitive grammar (C) Regular grammar (D) Context-free grammar 4. Which automaton recognizes context-free languages? (A) Pushdown Automaton (B) Non-deterministic Finite Automaton (C) Deterministic Finite Automaton (D) Turing Machine 5. Type 1 grammars are also called: (A) Regular grammars (B) Context-free grammars (C) Context-sensitive grammars (D) Unrestricted grammars 6. Which of the following languages is recognized by a linear bounded automaton? (A) Type 3 languages (B) Type 2 languages (C) Type 1 languages (D) Type 0 languages 7. Which Chomsky type is equivalent to recursively enumerable languages? (A) Type 3 (B) Type 0 (C) Type 1 (D) Type 2 8. Which of the following statements is true about Type 3 grammars? (A) Can generate nested structures (B) Recognized by finite automata (C) Require a stack for recognition (D) Can generate {aⁿbⁿ | n ≥ 0} 9. Which type of grammar allows productions of the form α → β where |α| ≤ |β|? (A) Type 0 (B) Type 2 (C) Type 1 (D) Type 3 10. Which of the following is true for context-free languages? (A) Recognized by PDA (B) Recognized by DFA (C) Recognized by LBA (D) Only finite languages 11. Which Chomsky type is the most restrictive? (A) Type 0 (B) Type 3 (C) Type 2 (D) Type 1 12. Which automaton can recognize Type 0 languages? (A) DFA (B) PDA (C) LBA (D) Turing Machine 13. Which of the following is not part of the Chomsky hierarchy? (A) Regular grammar (B) Context-free grammar (C) Deterministic grammar (D) Context-sensitive grammar 14. Type 3 grammars have productions of which form? (A) No restrictions (B) A → αβ (C) α → β, |α| ≤ |β| (D) A → aB or A → a 15. Which of the following is an example of a context-sensitive language? (A) {aⁿbⁿ | n ≥ 0} (B) {aa, bb} (C) {a, b}* (D) {aⁿbⁿcⁿ | n ≥ 0} 16. The intersection of two regular languages is: (A) Not regular (B) Always context-free (C) Always context-sensitive (D) Always regular 17. Which automaton is more powerful than a PDA but less powerful than a Turing Machine? (A) LBA (B) NFA (C) DFA (D) Mealy Machine 18. Which of the following is true about recursively enumerable languages? (A) Always finite (B) Recognized by PDA (C) Recognized by DFA (D) Recognized by Turing Machines 19. Type 2 languages can handle: (A) Only linear patterns (B) Only finite sequences (C) Arbitrary computation (D) Nested structures 20. Which of the following is not recognized by any finite automaton? (A) {a, b}* (B) {ab, ba} (C) {ε} (D) {aⁿbⁿ | n ≥ 0} 21. In Chomsky hierarchy, which type is closed under union? (A) Type 0 (B) Type 3 (C) Type 2 (D) Type 1 22. Which of the following automata has an infinite tape? (A) DFA (B) PDA (C) Turing Machine (D) LBA 23. Which property distinguishes Type 1 languages from Type 2 languages? (A) Use of finite automata (B) Context-sensitive rules (C) Only terminals on the left (D) Cannot generate recursive structures 24. Which of the following languages can be recognized by a non-deterministic PDA but not necessarily by a deterministic PDA? (A) {aⁿbⁿ | n ≥ 0} (B) {ε} (C) {a, b} (D) {ww | w ∈ {a, b}} 25. Which Chomsky type corresponds to grammars used in programming language syntax? (A) Type 0 (B) Type 1 (C) Type 3 (D) Type 2 26. Which is a closure property of context-free languages? (A) Union (B) Intersection (C) Complement (D) Difference 27. Which automaton is used to recognize context-sensitive languages? (A) DFA (B) PDA (C) Turing Machine (D) Linear Bounded Automaton 28. Type 0 grammars can generate: (A) Only finite languages (B) Only regular languages (C) All recursively enumerable languages (D) Only context-free languages 29. Which automaton has a stack as its memory? (A) DFA (B) PDA (C) NFA (D) Turing Machine 30. Which of the following statements is correct? (A) All recursively enumerable languages are regular (B) All context-free languages are regular (C) All context-sensitive languages are regular (D) All regular languages are context-free