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
301
Self Doubt.
what is the difference between, r* and r^(*) can anyone please elaborate !
what is the difference between, r* and r^(*) can anyone please elaborate !
User Avatar
0 votes
1 answer
302
Self Doubt
If for every RE there exist a TM that accepts it, is it possible that for 2 different RE languages there exists a single TM that accepts them?
If for every RE there exist a TM that accepts it, is it possible that for 2 different RE languages there exists a single TM that accepts them?
User Avatar
0 votes
1 answer
303
Self Doubt
Is the diagonalization language (Ld) countable?
Is the diagonalization language (Ld) countable?
User Avatar
0 votes
1 answer
304
Test Series gate@Zeal 2022
Please explain the ans. Ans is (B)
Please explain the ans. Ans is (B)
User Avatar
1 votes
1 answer
305
Gate@zeal Test Series 2022
Please explain with simplified diagram the transition in the pda. Ans (d)
Please explain with simplified diagram the transition in the pda. Ans (d)
User Avatar
0 votes
1 answer
307
Regular Expression
Identify whether the language is regular or not and plz justify the ans.
Identify whether the language is regular or not and plz justify the ans.
User Avatar
0 votes
0 answers
308
Theory of computation
How to decide function is Homorphism.
How to decide function is Homorphism.
User Avatar
0 votes
1 answer
309
Context free language
Why the complement of a CFL is CSL?
Why the complement of a CFL is CSL?
User Avatar
0 votes
0 answers
311
Theory Of Computation
please verify the answer I think BD on ‘b’ going on ‘BD’??
please verify the answerI think BD on ‘b’ going on ‘BD’??
User Avatar
2 votes
3 answers
312
Gate@Zeal 2022
please explain it how to solve such question in exam Ans: 22
please explain it how to solve such question in examAns: 22
User Avatar
0 votes
2 answers
315
Draw a DFA (Deterministic Finite Automation) that has a total number of zeros in the string divisble by two and three.
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.
User Avatar
1 votes
2 answers
317
why (a+b+c)*!= (a*+b*+c*) and why (a+b+c)* = (a*+b*+c*)*
From (a+b+c)* we can generate either a or b or c and kleene closure of that alphabet i.e a* or b* or c* which is same as (a*+b*+c*) .
From (a+b+c)* we can generate either a or b or c and kleene closure of that alphabet i.e a* or b* or c* which is same as (a*+b*+c*) .
User Avatar
Page: