Register
Filter

Questions by Rhythm

2 votes
2 answers
1
token generation doubt
which one of the following string can definitely said to be a token without looking at the next input: +(++,+=) return(return a) *(*=) =(==) ++ , ( ) ‘ ; option e is: plusplus, comma, bracket open, bracket close, single quote ;
which one of the following string can definitely said to be a token without looking at the next input:+(++,+=)return(return a)*(*=)=(==)++ , ( ) ‘ ; option e is: plu...
1 votes
1 answer
2
P and NP Question doubt
What will be the answer to this question? L’ is the complement of language L belongs to NP does not always imply that L’ belongs to NP L’ belongs to P both a and b
What will be the answer to this question? L’ is the complement of language L belongs to NP does not always imply thatL’ belongs to NPL’ belongs to P both a and b
1 votes
1 answer
3
If there is an $\rm NP$-complete language $L$ whose complement is in $\rm NP$, then...
If there is an $\rm NP$-complete language $L$ whose complement is in $\rm NP$, then the complement of any language in $\rm NP$ is in $\rm NP$ $\rm P$ Both (a) and (b) None of these
If there is an $\rm NP$-complete language $L$ whose complement is in $\rm NP$, then the complement of any language in $\rm NP$ is in$\rm NP$$\rm P$Both (a) and (b)None of...
0 votes
2 answers
4
P and np doubt
Are p and np languages all recursive? Because p and np both correspond to languages which have algorithms and algorithms means that there is a halting turning machine(either ntm or dtm). So np and p both should be recursive. Am i right here? Please answer
Are p and np languages all recursive? Because p and np both correspond to languages which have algorithms and algorithms means that there is a halting turning machine(eit...
1 votes
1 answer
5
Toc p and np
Are p and np problems both closed under union intersection and concatenation and kleene closure? If yes then how?
Are p and np problems both closed under union intersection and concatenation and kleene closure? If yes then how?
0 votes
1 answer
6
General doubt
I haven't done ardens theorem and my hill nerode theorem. However i have done questions based on them. Should i do these theorems if i am able to solve questions based on them using direct approaches shown in popular videos and all?
I haven't done ardens theorem and my hill nerode theorem. However i have done questions based on them. Should i do these theorems if i am able to solve questions based on...
0 votes
0 answers
7
Handwritten notes
a^m b^n where m+n=p how is this a cfl? Please explain. How will the stack be managed in this kind of language? also why can't cfl perform multiplication and subtraction? And why can't non linear languages like a^p, where p is a prime number, be accepted by pda.
a^m b^n where m+n=p how is this a cfl? Please explain. How will the stack be managed in this kind of language? also why can't cfl perform multiplication and subtraction? ...
0 votes
0 answers
8
Fa to re
I found out its regular expression to be 00(0+11*0+11*10)*11* is this regular expression correct for the finite automata given above?
I found out its regular expression to be00(0+11*0+11*10)*11*is this regular expression correct for the finite automata given above?
0 votes
0 answers
9
FA to Regular expressions Concept
For this given 3 state machine, what will be the regular expressions for the following cases: When A is the final state. When B is the final state When C is the final state
For this given 3 state machine, what will be the regular expressions for the following cases:When A is the final state. When B is the final stateWhen C is the final state...
0 votes
1 answer
10
Dfa doubt
What is the number of states in the minimal dfa representing the language a*b* ?
What is the number of states in the minimal dfa representing the language a*b* ?
0 votes
1 answer
11
Grammar doubt
L is regular <=> there exists a linear grammar for L. Which way is it true and which way is it false? Please explain in detail
L is regular <= there exists a linear grammar for L. Which way is it true and which way is it false? Please explain in detail
0 votes
1 answer
12
Cfg doubt
S→ aSb/epsilon is this linear grammar? I know it's a cfg but is it linear as well?
S→ aSb/epsilonis this linear grammar? I know it's a cfg but is it linear as well?
0 votes
1 answer
13
cfg doubt
Is context free grammar linear grammar?
Is context free grammar linear grammar?
0 votes
0 answers
14
Made e**y notes
0 votes
1 answer
15
General doubt
i wanted to ask that i have all the material for gate. But the question bank which i have(apart from the previous years) does not have answer key. Is it okay to solve questions without an answer key with your college faculty's help? Or should i purchase a fresh postal material?
i wanted to ask that i have all the material for gate. But the question bank which i have(apart from the previous years) does not have answer key. Is it okay to solve que...
1 votes
1 answer
16
Cfg to and from pda
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
0 votes
0 answers
17
pushdown automata
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
0 votes
1 answer
18
Nfa and dfa states doubt
Can i dfa has lesser states than an nfa?
Can i dfa has lesser states than an nfa?
0 votes
0 answers
19
Workbook
Page: