Formal Languages MCQ Test 2

1. Which of the following languages is always regular?

2. In the Chomsky hierarchy, which type of grammar is associated with context-free languages?

3. Which type of automaton is capable of recognizing context-sensitive languages?

4. What is the primary characteristic of a context-sensitive grammar?

5. What is the primary characteristic of a context-free grammar?

6. Which of the following machines can recognize context-sensitive languages?

7. In the Chomsky hierarchy, which type of grammar is the most restrictive?

8. Which of the following languages is inherently non-regular?

9. What is the purpose of a context-free grammar in the study of formal languages?

10. Which of the following is an invalid operation on context-free languages?