Register

Recent questions tagged gatebook-toc

0 votes
1 answer
2
Toc RLG to LLG
Construct right-linear grammar and left-linear grammar for the language L ={anbm : n$\geq$2 , m$\geq$3} Explanation about this....???
Construct right-linear grammar and left-linear grammar for the languageL ={anbm : n$\geq$2 , m$\geq$3}Explanation about this....???
User Avatar
3 votes
2 answers
5
TOC Gatebook
Let L = {xy | xwy L1, |x| = |w| = |y|}. Then L is(L1 is regular) (A). Regular (B). Non regular (C). May be regular (D). None
Let L = {xy | xwy L1, |x| = |w| = |y|}. Then L is(L1 is regular)(A). Regular(B). Non regular(C). May be regular(D). None
User Avatar
2 votes
1 answer
7
GBook
L = {B(N)#B(N+1) : B(N) represents binary pattern for given N. Example B(5)=101, N>=1}. Then which of the following is true for L? (A). L is regular (B). L is CFL but not regular (C). L is Recursive but not CFL (D). L is recursive enumerable but not recursive
L = {B(N)#B(N+1) : B(N) represents binary pattern for given N. Example B(5)=101, N>=1}. Then which of the following is true for L?(A). L is regular(B). L is CFL but not r...
User Avatar
1 votes
0 answers
8
Gatebook
Let L={x | x ϵ (0+1)* ,If x_{i}(bit at ith position of x)=1 then each of the next i positions must be a 1} then L is (A). R.E but not Recursive (B). CFL but not regular (C). Recursive but not C.F.L (D). Regular
Let L={x | x ϵ (0+1)* ,If x_{i}(bit at ith position of x)=1 then each of the next i positions must be a 1} then L is(A). R.E but not Recursive(B). CFL but not regular(C)...
User Avatar
4 votes
1 answer
9
GB TOC Q13
Which of the following is not regular? (A). {/n>=0 and input alphabet is {a,b}} (B). where i+j+k>100 & k>50 (C). where i+j+k>100 & j+k>50 (D). None of the above
Which of the following is not regular?(A). {/n>=0 and input alphabet is {a,b}} (B). where i+j+k>100 & k>50(C). where i+j+k>100 & j+k>50 (D). None...
User Avatar
To see more, click for the full list of questions or popular tags.