Automata Theory MCQ Test: Automata Theory MCQs - Practice Questions
1. Which of the following is a characteristic of recursively enumerable languages?
2. What is the significance of the hierarchy theorem in formal languages?
3. In automata theory, what does ε denote?
4. What does the Pumping Lemma for regular languages state?
5. Define a decidable language in the context of Turing machines.
6. What does the Church-Turing thesis propose?
7. In the context of automata theory, what is the purpose of the transition function?
8. Which of the following is a property of regular languages?
9. In the context of automata theory, what is a state's dominance?
10. What is the main focus of Automata Theory?
11. Which automaton has a stack?
12. Which of the following problems is not decidable?
13. In which automaton, the output depends on the current input and the current state?
14. Which type of automaton is used to recognize regular languages?
15. In formal language theory, what does the pumping lemma describe?
16. What is the purpose of formal languages in Automata Theory?
17. What does ε-transitions represent in NFA?
18. What is the primary purpose of a deterministic finite automaton (DFA)?
19. What does the Chomsky hierarchy classify?
20. Which automaton recognizes a regular language?
21. What is the primary difference between DFA and NFA?
22. What does the halting problem state?
23.
24. What is the primary difference between a deterministic pushdown automaton (DPDA) and a non-deterministic pushdown automaton (NPDA)?
25. In the context of computational models, what is a polynomial-time algorithm?
26. Which automaton type is more expressive: deterministic or non-deterministic?
27. What is the pumping lemma used for in formal language theory?
28. Which automaton is the most powerful?
29. Which automaton has the most computational power?
30. Which of the following is not a component of a Pushdown Automaton?