Chomsky Hierarchy and Automata Theory MCQs

30 min Score: 0 Attempted: 0/30 Subscribe
1. Which type of grammar is Type 0 in the Chomsky hierarchy?





2. Which automaton recognizes Type 3 languages (regular languages)?





3. What is a Type 2 grammar in the Chomsky hierarchy?





4. Which automaton recognizes context-free languages?





5. Type 1 grammars are also called:





6. Which of the following languages is recognized by a linear bounded automaton?





7. Which Chomsky type is equivalent to recursively enumerable languages?





8. Which of the following statements is true about Type 3 grammars?





9. Which type of grammar allows productions of the form α → β where |α| ≤ |β|?





10. Which of the following is true for context-free languages?





11. Which Chomsky type is the most restrictive?





12. Which automaton can recognize Type 0 languages?





13. Which of the following is not part of the Chomsky hierarchy?





14. Type 3 grammars have productions of which form?





15. Which of the following is an example of a context-sensitive language?





16. The intersection of two regular languages is:





17. Which automaton is more powerful than a PDA but less powerful than a Turing Machine?





18. Which of the following is true about recursively enumerable languages?





19. Type 2 languages can handle:





20. Which of the following is not recognized by any finite automaton?





21. In Chomsky hierarchy, which type is closed under union?





22. Which of the following automata has an infinite tape?





23. Which property distinguishes Type 1 languages from Type 2 languages?





24. Which of the following languages can be recognized by a non-deterministic PDA but not necessarily by a deterministic PDA?





25. Which Chomsky type corresponds to grammars used in programming language syntax?





26. Which is a closure property of context-free languages?





27. Which automaton is used to recognize context-sensitive languages?





28. Type 0 grammars can generate:





29. Which automaton has a stack as its memory?





30. Which of the following statements is correct?





Leave a Comment

All copyrights Reserved by MCQsAnswers.com - Powered By T4Tutorials