Register

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

Filter

Hot questions in Theory of Computation

1 votes
1 answer
6562
How to design grammar for below language ?
L={w ={a,b}* : (no of a's -no of b's) mod 3 =1 }
L={w ={a,b}* : (no of a's -no of b's) mod 3 =1 }
User Avatar
1 votes
0 answers
6563
TOC
User Avatar
1 votes
1 answer
6566
Properties of Regular Language
Union of Regular and non Regular is?
Union of Regular and non Regular is?
User Avatar
1 votes
1 answer
6567
Language is regular or not?
User Avatar
0 votes
1 answer
6568
Which of the following statements is/are True?
(a) If $R$ is regular and $N$ is non-regular, then there exists $R+N$, which is regular. (b) If $R$ is regular and $N$ is non-regular, then there exists $R+N$, which is non-regular.
(a) If $R$ is regular and $N$ is non-regular, then there exists $R+N$, which is regular.(b) If $R$ is regular and $N$ is non-regular, then there exists $R+N$, which is no...
User Avatar
0 votes
0 answers
6570
Correct substring in in fsm.
User Avatar
2 votes
1 answer
6572
give explanation..???
User Avatar
1 votes
1 answer
6575
toc
L={xwwr |x,w∈(a+b)+} CFL CSL none DCFL  
L={xwwr |x,w∈(a+b)+}CFLCSLnoneDCFL 
User Avatar
1 votes
0 answers
6576
toc
all FA is regular language but every regular language is not FA.?? wt does it mean.??
all FA is regular language but every regular language is not FA.?? wt does it mean.??
User Avatar
4 votes
3 answers
6579
What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?
What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?A. 8B. 9C. 6D. None
User Avatar
Page: