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

2 votes
1 answer
4235
TOC-reg
Complement of : {anbn | n>=0} ? Also tell if it is CFL or CSL?
Complement of : {anbn | n>=0} ?Also tell if it is CFL or CSL?
User Avatar
1 votes
1 answer
4236
TOC Question
Whats The Answer & How to solve such kind of Questions ?
Whats The Answer & How to solve such kind of Questions ?
User Avatar
0 votes
1 answer
4237
toc-reg
{ambncp|m+n+p>=10} Reg or not ?
{ambncp|m+n+p>=10} Reg or not ?
User Avatar
2 votes
1 answer
4239
TOC doubt
Intersection of two Recursive enumerable language or two recursive language or two CSL is undecidable then how it can be said that it is closed under intersection?? Thank You
Intersection of two Recursive enumerable language or two recursive language or two CSL is undecidable then how it can be said that it is closed under intersection??Thank ...
User Avatar
6 votes
3 answers
4240
TOC Naive Doubt
I'm so confused what happens when you concatenate/MUL Epsilon ε with any input symbol? What is ε.a = ? and what is ε.0 = ? what is ε.1= ?
I'm so confused what happens when you concatenate/MUL Epsilon ε with any input symbol?What is ε.a = ?and what is ε.0 = ?what is ε.1= ?
User Avatar
3 votes
3 answers
4241
TOC What language is this?
The given set is 1,2,4,8, . . . . . 2^n in unary number system which is shown in BOLD below L = {1,11,1111,11111111, . . . . . . . . } Is it regular or CFL?
The given set is 1,2,4,8, . . . . . 2^n in unary number system which is shown in BOLD belowL = {1,11,1111,11111111, . . . . . . . . }Is it regular or CFL?
User Avatar
3 votes
2 answers
4242
TOC Question
Sorry my BAD, it's an infinite language! The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
Sorry my BAD, it's an infinite language!The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
User Avatar
2 votes
1 answer
4243
SELF DOUBT
If we are having n states and m alphabets..how many DFAs and NFAs are possible?
If we are having n states and m alphabets..how many DFAs and NFAs are possible?
User Avatar
1 votes
0 answers
4244
self doubt
explain PCP and MPCP problem with example?
explain PCP and MPCP problem with example?
User Avatar
1 votes
0 answers
4245
Reverse of language in TOC
If I have string 100 then it's reverse is 001, but when a string is 101 then how it's reverse is 101? Reversal follow this rule - aWb ---> bWa then why in 101 we get 000?
If I have string 100 then it's reverse is 001, but when a string is 101 then how it's reverse is 101?Reversal follow this rule - aWb - bWa then why in 101 we get 000?
User Avatar
1 votes
1 answer
4246
TOC Doubt
Write the Regular Expression in which two a's should not come together? Please tell how to write this R.E in a step by step way, thanks!
Write the Regular Expression in which two a's should not come together?Please tell how to write this R.E in a step by step way, thanks!
User Avatar
5 votes
3 answers
4247
# regular expression
what is the regular expression for this given DFA?
what is the regular expression for this given DFA?
User Avatar
1 votes
0 answers
4248
finite automata
pls explain how to solve
pls explain how to solve
User Avatar
1 votes
2 answers
4249
Theory of computation
No of State for minimal DFA for empty language ? If your answer is 1 or 2 then please explain to support your answer
No of State for minimal DFA for empty language ?If your answer is 1 or 2 then please explain to support your answer
User Avatar
Page: