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

7 votes
2 answers
154
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivale...
2 votes
2 answers
155
Choose the correct one -A) a FSM with 1 stack is more powerful than a FSM without stackB) a FSM with 3 stack is more powerful than a FSM with 2 stackC) a FSM with 2 stack...
32 votes
8 answers
157
0 votes
2 answers
159
10 votes
1 answer
163
6 votes
1 answer
165
What exactly Homomorphism of a language is? What is the need of it? .. And how is it closed under regular languages?
44 votes
6 answers
168
29 votes
2 answers
170