Dark Mode

Questions by sanju77767

0 votes

1 answer

1

Pushdown automata
L={ai bj | i ≠ 2j+1} please give PDA for this language

asked in Theory of Computation Sep 16, 2018

420 views

1 vote

0 answers

2

Self programming doubt

asked in Programming in C Sep 3, 2018

506 views

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

asked in Compiler Design Jul 13, 2018

127 views

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

asked in Mathematical Logic May 20, 2018

286 views

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

asked in Theory of Computation May 17, 2018

1.1k views

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

asked in Theory of Computation May 17, 2018

237 views

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

asked in Theory of Computation May 17, 2018

434 views

0 votes

1 answer

8

Functionally Completeness
f(A,B,C)=A'+BC' is this functionally Complete For AND PLZZ give solution

asked in Digital Logic May 15, 2018

552 views

1 vote

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 .......

asked in Theory of Computation May 7, 2018

391 views

0 votes

0 answers

10

TOC PDA machine
Is my PDA correct or not plzz rectify me If I have made a mistake

asked in Theory of Computation May 7, 2018

150 views

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

asked in Theory of Computation May 5, 2018

261 views

1 vote

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

asked in Theory of Computation May 4, 2018

479 views

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

asked in Theory of Computation May 3, 2018

451 views

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

asked in Theory of Computation May 1, 2018

1.3k views

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 ..........

asked in Theory of Computation May 1, 2018

400 views

0 votes

0 answers

16

kleene method TOC
plzz help to understand this kleene method plzzzz explain properly

asked in Theory of Computation Apr 30, 2018

236 views

0 votes

1 answer

17

Moore machine example
plzz expain this machine how it is working machine is Addition of two binary numbers

asked in Theory of Computation Apr 30, 2018

3.3k views

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

asked in Theory of Computation Apr 29, 2018

271 views

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 )

asked in Theory of Computation Apr 23, 2018

4.2k views

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

asked in Theory of Computation Apr 2, 2018

1.9k views

Page: