GATE CSE · Computer Science and Information Technology
Regular and context-free languages; automata; Turing machines and undecidability.
Test yourself on Theory of Computation
5 real GATE CSE questions with instant answers — no signup, ~3 minutes.
Study notes are still being prepared.
Don't wait — Shishya can teach you this topic right now, on demand.
Ask Shishya to teach this →Shishya is your personal tutor for this topic. Pick a starter or open a free chat.
Q1 · Theory of Computation · EASY
Let L be a regular language over the alphabet {0, 1}. Which of the following languages is guaranteed to be regular?
Q2 · Theory of Computation · MEDIUM
Consider the language L = {aⁿbⁿcⁿ | n ≥ 1}. Which class of automata is the minimum required to recognize L?
Q3 · Theory of Computation · MEDIUM
Which of the following languages is NOT context-free?
Q4 · Theory of Computation · MEDIUM
Which of the following languages is NOT context-free?
Q5 · Theory of Computation · HARD
Consider the language L = {a^n b^m c^k | n = m or m = k, where n, m, k ≥ 1}. Which of the following statements is correct?