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

Recent questions in Theory of Computation

0 votes
1 answer
6401
Rice Theorem
User Avatar
1 votes
2 answers
6402
Type of language ?
it will be accepted by NPDA. Right ??
it will be accepted by NPDA. Right ??
User Avatar
1 votes
1 answer
6403
minimum no. of states
User Avatar
0 votes
1 answer
6406
Elimination of epsilon
Question : (Here e=epsilon) S->A|B, A->e, B->aBb, B->b My answer is : S->B, B->aBb , B->b or S->B|e , B->aBb , B->b Want to know which one is correct ? please explain...
Question : (Here e=epsilon) S->A|B, A->e, B->aBb, B->bMy answer is :S->B, B->aBb , B->b orS->B|e , B->aBb , B->bWant to know which one is correct ? please explain...
User Avatar
4 votes
2 answers
6409
DFA for the given regular expressions
(aa*)b (abab)+(aaa+b)*
(aa*)b(abab)+(aaa+b)*
User Avatar
1 votes
1 answer
6411
plz answer ..
let q0 and q1 are two states and q0 is always initial state over the alphabet {a,b}, the possible number of dfa's with two states q0 and q1 are 16,32,64,80
let q0 and q1 are two states and q0 is always initial state over the alphabet {a,b}, the possible number of dfa's with two states q0 and q1 are16,32,64,80
User Avatar
3 votes
3 answers
6415
which of the following statements is correct regarding Regular language?
1.Every Ragular Language have an equivalent LR(0)grammer. 2. Every DCFL have an equivalent LR(0) grammer
1.Every Ragular Language have an equivalent LR(0)grammer.2. Every DCFL have an equivalent LR(0) grammer
User Avatar
2 votes
5 answers
6416
difference between phi and epsilon?
User Avatar
2 votes
3 answers
6417
it necessary for a dfa to have to have atleast one final state?
User Avatar
3 votes
2 answers
6418
Is the language WXW^R is a regular ?
is the language WXWR is regular? can any one provide the proof?
is the language WXWR is regular? can any one provide the proof?
User Avatar
3 votes
3 answers
6419
Can DPDA accept ambiguous grammars?
Option D is correct. But G is ambiguous. Can DPDA accept G?
Option D is correct. But G is ambiguous. Can DPDA accept G?
User Avatar
Page: