Web Page

Regular expressions and finite automata, Context-free grammars and push-down automata, Regular and context-free languages, Pumping lemma, Turing machines and undecidability.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2 &2&3&3&2&2&2&3&3&3&2&2.5&3
\\\hline\textbf{2 Marks Count} & 3 &3&4&3&3&3&5&3&3&3&3&3.3&5
\\\hline\textbf{Total Marks} & 8 &8&11&9&8&8&12&9&9&9&\bf{8}&\bf{9.1}&\bf{12}\\\hline
\end{array}}}$$

Recent questions in Theory of Computation

1 votes
2 answers
171
2 votes
0 answers
172
0 votes
1 answer
173
which one true1. Determining whether context-free grammar is un-decidable2. Whether a given grammar is context-free is decidable
0 votes
1 answer
177
Consider L is recursive language and G is Recursively Enumerable then,L' union G is Recursively enumerable. Can someone please explain me this statement why it is true.?...
0 votes
0 answers
178
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
0 votes
0 answers
179
0 votes
0 answers
180
i need to construct PDA for L = {a^m b^n: m>= n-5}L = {w belongs to {a,b}*: w has twice as many a’s as b’s}