Q1. Which of the following is the main study area of Theory of Computation?
📘 View Explanation
Q2. Which automaton recognizes regular languages?
📘 View Explanation
Q3. Which automaton recognizes context-free languages?
📘 View Explanation
Q4. Which machine can solve all problems that are algorithmically solvable?
📘 View Explanation
Q5. Which of the following is NOT a formal language type?
📘 View Explanation
Q6. Which is an example of a regular expression?
📘 View Explanation
Q7. What is the main difference between DFA and NFA?
📘 View Explanation
Q8. Which machine has memory in the form of a stack?
📘 View Explanation
Q9. Which problem is undecidable?
📘 View Explanation
Q10. Which language type is more powerful than context-free but less than Turing-recognizable?
📘 View Explanation
Q11. Which diagram represents state transitions?
📘 View Explanation
Q12. Which of the following is a property of regular languages?
📘 View Explanation
Q13. Which is a type of Turing Machine?
📘 View Explanation
Q14. Which is an example of context-free language?
📘 View Explanation
Q15. Which automaton can recognize the language {a^n b^n | n ≥ 0}?
📘 View Explanation
Q16. Which of the following is true for NFA and DFA?
📘 View Explanation
Q17. Which machine uses unlimited tape as memory?
📘 View Explanation
Q18. Which language class is also known as recursively enumerable?
📘 View Explanation
Q19. Which of the following represents a formal grammar?
📘 View Explanation