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

Most viewed questions in Theory of Computation

0 votes
1 answer
3931
is regular grammar does not generate empty string?
User Avatar
0 votes
0 answers
3932
CHART
User Avatar
0 votes
0 answers
3933
#Gatebook Qno.26
There is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products, left recursion,). What would be the max number of productions if that gets converted into GNF (A). 2 (B). <=4 (C). <=8 (D). None
There is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products, left recursion,). What would be the max number of...
User Avatar
0 votes
1 answer
3937
made easy test series
Consider P and Q be language over Σ = {0, 1} represented by the regular expression 0* (10*)* and (0* + 1*)* respectively. Which of the following is true? A) P⊂Q B) Q⊂P C) P=Q D)P∩Q=0*1*
Consider P and Q be language over Σ = {0, 1} represented by the regular expression 0* (10*)* and (0* + 1*)* respectively. Which of the following is true?A) P⊂QB) Q⊂P...
User Avatar
0 votes
0 answers
3939
Test series
If possible , plz explain with state diagram..
If possible , plz explain with state diagram..
User Avatar
1 votes
1 answer
3942
_/\_Doubt_/\_
What is the complement of Non-Recursive Enumerable Language ?
What is the complement of Non-Recursive Enumerable Language ?
User Avatar
0 votes
0 answers
3943
#TOC #NesoAcademy #Tutorial
“ Every state on $\epsilon$ goes to itself in $\epsilon NFA$ “ How is this so?
“ Every state on $\epsilon$ goes to itself in $\epsilon NFA$ “How is this so?
User Avatar
0 votes
0 answers
3944
Is there any person here who knows theory of computation subject very well?
I need help in theory of computation subject... I would be thankful to that guy ...will pray for him ....... Please clear my concept about the said subject.… Share your contact or watsap me on 9858964515.... Please
I need help in theory of computation subject... I would be thankful to that guy ...will pray for him ....... Please clear my concept about the said subject.…Share your ...
User Avatar
0 votes
0 answers
3945
Identify Formal Languages
1.L={xww|x,w$\epsilon \left \{ 0,1 \right \}^{\dotplus }$} 2.L={xww|x,w$\epsilon \left \{ 0,1 \right \}^{\star}$} identify formal language
1.L={xww|x,w$\epsilon \left \{ 0,1 \right \}^{\dotplus }$}2.L={xww|x,w$\epsilon \left \{ 0,1 \right \}^{\star}$}identify formal language
User Avatar
0 votes
1 answer
3946
Gate overflow old question
Referring to the question https://gateoverflow.in/227957/self-doubt If the TM accepts exactly 100 strings can we not design a FA for it which would make it a regular language?
Referring to the question https://gateoverflow.in/227957/self-doubtIf the TM accepts exactly 100 strings can we not design a FA for it which would make it a regular langu...
User Avatar
0 votes
0 answers
3947
Self Doubt
Is there any method to check equivalence of two regular expressions other than checking all strings of two set? I mean sometimes I may miss a string.
Is there any method to check equivalence of two regular expressions other than checking all strings of two set?I mean sometimes I may miss a string.
User Avatar
0 votes
2 answers
3948
finite language, cfl
Is {a^nb^n|n>0} a finite language?
Is {a^nb^n|n>0} a finite language?
User Avatar
1 votes
0 answers
3949
TOC-NFA
User Avatar
Page: