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

1 votes
1 answer
6031
Closure Properties Table
https://gateoverflow.in/?qa=blob&qa_blobid=8929616163903734815
https://gateoverflow.in/?qa=blob&qa_blobid=8929616163903734815
User Avatar
2 votes
3 answers
6034
TOC
Consider the language given below .Find the complement of these language and Explain Complementary language? 1.wwr | w∈(a ,b)* 2.wxwr| x,w∈(a,b)+ 3.ww ∣ w∈(a,b)+ 4.wxw∣ x,w∈(a,b)+
Consider the language given below .Find the complement of these language and Explain Complementary language?1.wwr | w∈(a ,b)*2.wxwr| x,w∈(a,b)+3.ww ∣ w&is...
User Avatar
27 votes
3 answers
6035
GATE CSE 2007 | Question: 75
Consider the following Finite State Automaton: The minimum state automaton equivalent to the above FSA has the following number of states: $1$ $2$ $3$ $4$
Consider the following Finite State Automaton:The minimum state automaton equivalent to the above FSA has the following number of states:$1$$2$$3$$4$
User Avatar
3 votes
4 answers
6047
regular exp[ression
Which of the following regular expression identities are true ? (A) (r + s)* = r* s* (B) (r + s)* = r* + s* (C) (r + s)* = (r*s*)* (D) r* s* = r* + s*
Which of the following regular expression identities are true ?(A) (r + s)* = r* s*(B) (r + s)* = r* + s*(C) (r + s)* = (r*s*)*(D) r* s* = r* + s*
User Avatar
3 votes
5 answers
6048
#Regular Expression
The regular expression 0*(10*)* denotes the same set as (A) (1*0)*1* (B) 0 + (0 + 10)* (C) (0 + 1)* 10(0 + 1)* (D) none of these
The regular expression 0*(10*)* denotes the same set as(A) (1*0)*1*(B) 0 + (0 + 10)*(C) (0 + 1)* 10(0 + 1)*(D) none of these
User Avatar
0 votes
1 answer
6049
how to implement quick sort with turing machine
User Avatar
Page: