Concept drill

Undecidable Problems

GATE CSE & IT · Theory of Computation - Decidability · 1989-2017

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Source-book anchor pending for this concept.

Practice action

Start latest PYQ

PYQs in this concept

All concepts →

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...

mediumanswer key

1989 PYQ

Which of the following problems are un-decidable?

mediumanswer key