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
91
made easy
User Avatar
0 votes
0 answers
93
Theory of Computation
L = a^n / n is odd number is a Regular language but by checking it with pumping lemma it’s getting as Not Regular.why? https://gateoverflow.in/?qa=blob&qa_blobid=15872129177586526309
L = a^n / n is odd number is a Regular languagebut by checking it with pumping lemma it’s getting as Not Regular.why?https://gateoverflow.in/?qa=blob&qa_blobid=158721...
User Avatar
0 votes
1 answer
94
Applied roots practice set3 TOC 2019
Solve this using Adrens lemma rule.
Solve this using Adrens lemma rule.
User Avatar
0 votes
1 answer
95
Internet
Consider the following language definition: L= {(M) | M is a DFA and M accepts some string of the form ww^R for some w€ Σ L is A. Regular B. Context-free but not regular C. Recursive but not context-free D. Recursively enumerable but not recursive
Consider the following language definition:L= {(M) | M is a DFA and M accepts some string of the form ww^R for some w€ ΣL isA. RegularB. Context-free but not regularC....
User Avatar
0 votes
1 answer
96
#Gate CS Applied Course
is this correct DFA ?
is this correct DFA ?
User Avatar
0 votes
1 answer
97
1 State DFA
There is one and only one finite language that can be accepted by a 1-state DFA. True or False? Explain.
There is one and only one finite language that can be accepted by a 1-state DFA. True or False? Explain.
User Avatar
0 votes
2 answers
100
MADE EASY test series
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
User Avatar
1 votes
2 answers
103
physics wallah question
$L_1=a^ * b^ *$ $L_2=a^ + b^ +$ Find $L_2-L_1$: A. $a ^ *$ B. $b ^ *$ C. $a ^ * +b^ *$ D. None
$L_1=a^ * b^ *$$L_2=a^ + b^ +$Find $L_2-L_1$:A. $a ^ *$B. $b ^ *$C. $a ^ * +b^ *$D. None
User Avatar
0 votes
1 answer
104
made easy test series 2023 question
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following: Which one of them is correct ?
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following:Which one of them is correct ?
User Avatar
0 votes
1 answer
105
made easy test series 2023 toc question
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
User Avatar
0 votes
2 answers
106
Made Easy Book
114
114
User Avatar
0 votes
1 answer
107
#regularexpressions #Theoryofcomputation
L = (a+b)$\small ^*$b is equivalent to ____________? A. (ab$\small^*$)$\small^+$ B. (a$\small^+$b$\small^*$)$\small^+$ C. b$\small^*$(ab$\small^*$)$\small^*$b D. None
L = (a+b)$\small ^*$b is equivalent to ____________?A. (ab$\small^*$)$\small^+$B. (a$\small^+$b$\small^*$)$\small^+$C. b$\small^*$(ab$\small^*$)$\small^*$bD. None
User Avatar
1 votes
1 answer
108
#Theoryofcomputation #regularexpressions
A = aa* and B = bb* ( A U B) * =? 1.{ a^nb^n | n >= 0} 2.{ a^mb^n | m, n >=0} 3.(a+b)* 4.None
A = aa* and B = bb*( A U B) * =? 1.{ a^nb^n | n >= 0}2.{ a^mb^n | m, n >=0}3.(a+b)*4.None
User Avatar
Page: