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}}}$$

Most viewed questions in Theory of Computation

0 votes
0 answers
6181
1 votes
1 answer
6182
identify the class of language{a^(m)b^(n)} for followinga) m + n = 10b) m + n <=10c)m+n>10d) m+n<10e) m + n>=10f) m/n = 10g) m - n = 10
0 votes
0 answers
6188
IS EQUALITY PROBLEM ON DCFL IS DECIDABLE ???
0 votes
0 answers
6189
1 votes
1 answer
6190
Question 4.
0 votes
0 answers
6191
Is REC closed under Kleene closure and positive closure?
1 votes
0 answers
6192
1) language that contain epsilon can convert into CNF ?2) language that contain epsilon can convert into GNF ?
0 votes
0 answers
6193
The set of languages accepted by a DPDA by empty stack is a strict subset of the set of languages accepted by a DPDA by final state.someone please explain this with examp...
0 votes
0 answers
6196
3 votes
1 answer
6198
0 votes
0 answers
6199
The Language is given by,L is a A) Deterministic CFL.B) Non deterministic CFL but not DCFL.I feel option A) ....if so please check the below DPDA ....Is it correct ???
0 votes
0 answers
6200