Skip to content
Early access — you're among the first to try PYQLabs. Share feedback

Theory of Computation - Decidability

GATE CSE & IT · 2 questions across 2 years (2017-2025) · 5% recurrence rate

Start topic drillBack to CSE & IT

Recurrence sparkline

2017–2025
201720212025

Difficulty mix

med 100%

Question types

MCQ2

All 2 questions on Theory of Computation - Decidability

2025 Q25

Let G1, G2 be Context Free Grammars (CFGs) and R be a regular expression. For a grammar G, let L(G) denote the language generated by G. Which ONE among the following questions is decidable?

Med✓
2017 Q41

Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M. Which of the following decision probl...

Med✓