Concept drill
emptiness problem
GATE CSE & IT · Turing Machines & Computability · 2021-2025
2
PYQs
100%
keyed
0
elite explanations
2
years appeared
Study anchor
Hopcroft-Ullman / Dragon Book
Automata, languages, parsing, syntax-directed translation
Practice action
Start latest PYQPYQs in this concept
All concepts →2025 PYQ
Let $G_1, G_2$ 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 qu...
easyanswer keybasic explanation
2021 PYQ
Let $$\left\langle M \right\rangle $$ denote an encoding of an automation M. Suppose that ∑ = {0, 1}. Which of the following languages is/are NOT recursive?
mediumanswer keybasic explanation