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

acceptance problem

GATE CSE & IT · Turing Machines & Computability · 1990-1990

1
PYQs
100%
keyed
0
elite explanations
1
years appeared

Study anchor

Hopcroft-Ullman / Dragon Book

Automata, languages, parsing, syntax-directed translation

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
1990 PYQ

State whether the following statement is TRUE / FALSE. The problem is to whether a Turing Machine M accepts input $$w$$ is un-decidable.

easyanswer key