0 votes
0 answers
2
How to solve matching problem?How to solve counting problem?How to solve first order logic problem?Thanks. Do help if possible.
0 votes
1 answer
3
G : GrammarS1 : Every LALR(1) G is LR(1).S2 : Every LR(1) G is LALR(1).S3: Some LL(1) is Regular.A. TFF B.TFT C. TTF D. FTT E. NONE
1 votes
1 answer
4
T(n) = 4T(sqrt(n)) + (logn)^5Find Time complexity.(n=2^k)Give detailed answer , how to derive it.
1 votes
2 answers
5
R(ABCDEF)FD set{AB->CDE. CD->E, E->C}False statement?A. 2 NF decomposition possibleB.3 NF decomposition possibleC.BCNF decomposition possibleD. ALL
0 votes
1 answer
7
L1 and L2 Are Decidable. then L1 union L2 is (a)______and L1 - L2 is(b) _________.a. Regular, cfl ,csl, rel. recb. decidable, undecidable
0 votes
1 answer
8
0 votes
1 answer
9
L={a^n b^k, n <= k <=2n}1.CFL2.Non CFL
0 votes
1 answer
10
Which of following Is closed under Homomorphism?A. Computable Enumerable LanguageB. Decidable LanguageC. DCFLD. CSL Explain Neatly.
0 votes
1 answer
11
A Connected Graph has Cut edge, Then Graph has Cut vertex also.1. True2. FalseChoose Correct One.