Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by sanju77767
0
votes
1
answer
1
Pushdown automata
L={ai bj | i ≠ 2j+1} please give PDA for this language
L={ai bj | i ≠ 2j+1}please give PDA for this language
427
views
asked
Sep 16, 2018
Theory of Computation
pushdown-automata
+
–
1
votes
0
answers
2
Self programming doubt
522
views
asked
Sep 3, 2018
0
votes
0
answers
3
Compiler design
Does operator precendence parser also follows Reverse of Right most derivation If yes I Have constructed this plzz help me it is not following Reverse of right most derivation
Does operator precendence parser also follows Reverse of Right most derivation If yes I Have constructed this plzz help me it is not following Reverse of right most deri...
131
views
asked
Jul 13, 2018
0
votes
0
answers
4
Combinatrics
In Circular permutation generally we are taking (N-1)! we are fixing a reference at any point of the circle (we can't change the reference after fixing it) But (N-1)! is for N distinct objects but if there is some repetition in the word we are ... word t as a reference then ans is going to be 11! plzz clarify my doubt and after fixing the reference can we change the reference
In Circular permutation generally we are taking (N-1)! we are fixing a reference at any point of the circle (we can't change the reference after fixing it)But (N-1)! is f...
297
views
asked
May 20, 2018
0
votes
1
answer
5
PDA for a language
$a^i b^j / i$ should not be equal to $2j+1$ give PDA for this language
$a^i b^j / i$ should not be equal to $2j+1$give PDA for this language
1.1k
views
asked
May 17, 2018
Theory of Computation
theory-of-computation
pushdown-automata
+
–
0
votes
0
answers
6
TOC Language is CFL or not
xx^r /x=[0,1]* , |x|=l Here we have restriction that on length of x should be exactly l If only the language is given How can we say that l is finite or infinite In one of the videos they have taken subsets of l also 2^l , how can this language be Regular and CFL plzz explain each point properly
xx^r /x=[0,1]* , |x|=lHere we have restriction that on length of x should be exactly l If only the language is given How can we say that l is finite or infinite In one of...
244
views
asked
May 17, 2018
0
votes
0
answers
7
regular language and CFL
$L=\left \{ a^{n}b^{n}c^{n}d^{n} | n<10^{10} \right \}$ I know this language is regular language so it is DCFL AND CFL also but how can we implenment this language with DCFL with stack because till we reach c there ... language can be implemented using FA We can have these many states to compare how we will compare in stack explain the logic of this language with DCFL
$L=\left \{ a^{n}b^{n}c^{n}d^{n} | n<10^{10} \right \}$I know this language is regular language so it is DCFL AND CFL alsobut how can we implenment this language with DCF...
442
views
asked
May 17, 2018
Theory of Computation
theory-of-computation
dcfl
+
–
0
votes
1
answer
8
Functionally Completeness
f(A,B,C)=A'+BC' is this functionally Complete For AND PLZZ give solution
f(A,B,C)=A'+BC'is this functionally Complete For AND PLZZ give solution
570
views
asked
May 15, 2018
1
votes
1
answer
9
TOC language is CFL or not
L={a^n,b^n,c^m / n>m} we have to compare n and m everywhere I know till we reach b there will be nothing in the stack BUT generally we can make this language if possible suppose when we are putting one a into the stack suppose we put Two ... I'm asking this question because in one of the video for the question we were taking two a's on behalf of one .......
L={a^n,b^n,c^m / n>m}we have to compare n and m everywhere I know till we reach b there will be nothing in the stack BUT generally we can make this language if possible s...
402
views
asked
May 7, 2018
0
votes
0
answers
10
TOC PDA machine
Is my PDA correct or not plzz rectify me If I have made a mistake
Is my PDA correct or not plzz rectify me If I have made a mistake
158
views
asked
May 7, 2018
0
votes
0
answers
11
TOC push down automata
Can we put simultanously Two symbols in stack in one of the video on youtube it is showing that we can put two a's on to the stack I'm not finding it correct plzz calrify my doubt it on place of one a we are putting two a's one extra a is ... because any how 1 b is poping out 1 a then no.of b's will be fine but what about one extra which has been take out
Can we put simultanously Two symbols in stack in one of the video on youtube it is showing that we can put two a's on to the stack I'm not finding it correct plzz calrify...
266
views
asked
May 5, 2018
1
votes
1
answer
12
TOC Push down automata
Can we put simultanously Two symbols in stack in one of the video on youtube it is showing that we can put two a's on to the stack I'm not finding it correct plzz calrify my doubt it on place of one a we are putting two a's one extra a is ... because any how 1 b is poping out 1 a then no.of b's will be fine but what about one extra which has been take out
Can we put simultanously Two symbols in stack in one of the video on youtube it is showing that we can put two a's on to the stack I'm not finding it correct plzz calrify...
515
views
asked
May 4, 2018
0
votes
0
answers
13
TOC questions
L={a^n \ n>=0} M={b^n \ n>=0} L.M is a regular language and the DFA for this is going to be ending with b and epsilon and it will have two states Am I correct or not
L={a^n \ n>=0} M={b^n \ n>=0}L.M is a regular language and the DFA for this is going to be ending with b and epsilon and it will have two states Am I correct or not
470
views
asked
May 3, 2018
0
votes
2
answers
14
TOC question on Regular expresstion
Find length of string of minimum length on {0,1}* not in the language corressponding to the given RE 0^*(01^*)^* options are 1 2 3 None of these Is it asking to find the minimum length string and then length of it if yes then minimum length can be ... ans is 1 plzz rectify me if I have not understand the question properly second RE 1^*(0+10)^* options are 2 3 4 5
Find length of string of minimum length on {0,1}* not in the language corressponding to the given RE 0^*(01^*)^* options are 123None of theseIs it asking to find the mini...
1.4k
views
asked
May 1, 2018
Theory of Computation
regular-expression
+
–
0
votes
2
answers
15
TOC regular language
L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular ..........
L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular .......
407
views
asked
May 1, 2018
Theory of Computation
regular-language
+
–
0
votes
0
answers
16
kleene method TOC
plzz help to understand this kleene method plzzzz explain properly
plzz help to understand this kleene method plzzzz explain properly
250
views
asked
Apr 30, 2018
0
votes
1
answer
17
Moore machine example
plzz expain this machine how it is working machine is Addition of two binary numbers
plzz expain this machine how it is working machine is Addition of two binary numbers
3.4k
views
asked
Apr 30, 2018
0
votes
1
answer
18
Theory of computetion
Suppose we have a FA N(a)mod3=0 In this FA the initial state and final state is same If we will reverse this FA the state will be remain same or not that initial state and final state is going to be the same or not and after reversing the string the strings are not getting reverse it will accept only $L=\{\epsilon,b,bb,bbbb,bbb,bbbbbb.............\}$ plzz rectify my doubt
Suppose we have a FA N(a)mod3=0 In this FA the initial state and final state is sameIf we will reverse this FA the state will be remain same or not that initial state a...
282
views
asked
Apr 29, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
19
TOC substring
sequence of symbols from any part of the given string over an alphabet is called a substring for abb 0length is epsilon 1 length is a,b 2 length is ab,bb 3 length is abb how bb can be a substring because we have skipped a if the above case is true then ... not b here can be a prefix over here above in two length string we are skipping a and taking bb as a two length substring )
sequence of symbols from any part of the given string over an alphabet is called a substring for abb 0length is epsilon 1 length is a,b 2 length is ab,bb3 length is abbho...
4.3k
views
asked
Apr 23, 2018
0
votes
2
answers
20
TOC regular grammar question
29791305_10156267704977640_8232384361710835589_n.jpg960x579 25.7 KB plzzz check this A and D are already eliminated Option B and C are equivalent or not… Any string which I’m taking is getting accepted in both B and C If they are not equal plzz give the reason
29791305_10156267704977640_8232384361710835589_n.jpg960x579 25.7 KBplzzz check this A and D are already eliminatedOption B and C are equivalent or not…Any string which ...
2.0k
views
asked
Apr 2, 2018
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
