Register
Filter

Questions by AnilGoudar

0 votes
1 answer
41
Homomorphism and Inverse homomorphism
Let L1 = { anb2n | n >= 1}, and h(p) = a , h(q) = aa. If L2 = h-1(L1) . What will be the language? Please explain the operation of homomorphism for understanding. I am unable to follow inverse homomorphism.
Let L1 = { anb2n | n >= 1}, and h(p) = a , h(q) = aa.If L2 = h-1(L1) . What will be the language?Please explain the operation of homomorphism for understanding. I am unab...
1 votes
1 answer
42
DCFL, LR(k), 2DFA
Let L1 be a language from DCFL, L2 be from LR(k) grammar, and L3 be a language accepted by 2DFA. Choose the correct statement, 1) There is no algorithm to decide if L1⋂L2 is empty. 2) L1 = L2. 3) L2 = L3. 4) A problem of L1 = L3 is undecidable.
Let L1 be a language from DCFL, L2 be from LR(k) grammar, and L3 be a language accepted by 2DFA.Choose the correct statement,1) There is no algorithm to decide if L1⋂L2...
0 votes
2 answers
44
Operator Grammar
Given an Operator Grammar as, E -> E*F / F+E / F F -> F-F / id How to determine associativity in this case? Since Operator grammar can be ambiguous also. Is the above question solved using associativity and precedence of operators we consider in C programming? or it is Different.
Given an Operator Grammar as,E - E*F / F+E / FF - F-F / idHow to determine associativity in this case? Since Operator grammar can be ambiguous also.Is the above question ...
3 votes
1 answer
45
Meaning of this
What is the meaning of the following sentence, Canonical covers are used to decompose a relation into 3NF, which is a small relaxation of the BCNF condition. Please explain.
What is the meaning of the following sentence,Canonical covers are used to decompose a relation into 3NF, which is a small relaxation of the BCNF condition.Please explai...
1 votes
1 answer
47
Doubt
What is redundant FD when we are given a set of FD set. Please explain with example.
What is redundant FD when we are given a set of FD set. Please explain with example.
3 votes
1 answer
48
Doubt on Regular and unambiguous
Please explain with examples, 1)is every regular grammar is unambiguous? 2) An unambiguous grammar will always generate DCFL?
Please explain with examples,1)is every regular grammar is unambiguous?2) An unambiguous grammar will always generate DCFL?
1 votes
0 answers
49
LL grammar and DCFL
True or False , 1) Is every LL grammar have one to one correspondance with DCFL? Please explain with examples.
True or False ,1) Is every LL grammar have one to one correspondance with DCFL?Please explain with examples.
2 votes
2 answers
50
Self Doubt TOC Enumeration Method
If language L is countable infinite set then, L is Recursive as we can define enumeration method for the countable set. or It can Regular ??
If language L is countable infinite set then, L is Recursive as we can define enumeration method for the countable set.or It can Regular ??
1 votes
1 answer
52
Doubt in Class A ip address.
A small doubt we know that, in class A, the 31st bit is 0. i.e. First octet is - 0 _ _ _ _ _ _ _ then minimum value is 0 and 127. But we say that, Range of first octet is (1,127). I am confused here, please help me to understand this
A small doubtwe know that, in class A, the 31st bit is 0.i.e.First octet is - 0 _ _ _ _ _ _ _then minimum value is 0 and 127. But we say that,Range of first octet is (1,1...
1 votes
2 answers
54
Doubt
The number of unique strings in L((a+b)* a(b+ba)* ) of length less than four is _____
The number of unique strings in L((a+b)* a(b+ba)* ) of length less than four is _____
1 votes
3 answers
55
Self Doubt
While Subnetting, is it valid to buy bits from Network Id part ? Or Only we should buy bits from Host Id Part?? Please correct me if i am wrong.
While Subnetting, is it valid to buy bits from Network Id part ? Or Only we should buy bits from Host Id Part??Please correct me if i am wrong.
3 votes
3 answers
56
Number of Flip-Flops
Let the counting Sequence be 0 - 1 - 0 - 2 - 0 - 3 - 1, Then How many flip flops are required to implement the counter?
Let the counting Sequence be 0 - 1 - 0 - 2 - 0 - 3 - 1, Then How many flip flops are required to implement the counter?
0 votes
1 answer
57
Self Doubt in Sparse Indexing and Dense Indexing
Is it possible to have an Index file which is both dense index and sparse Index?
Is it possible to have an Index file which is both dense index and sparse Index?
4 votes
1 answer
58
CFL and DCFL
If L1 = { anbncm | n.m >0 } L2 = { anbmcm | n, m > 0} Which of these following are false? 1) L1 ∩ L2 is CFL. 2) L1 ∪ L2 is CFL. 3) L1 and L2 are CFL. 4) L1 ∩ L2 is CSL. I think (1) is FALSE as L1 ∩ L2 becomes CSL. PLease correct me if iam wrong.
If L1 = { anbncm | n.m >0 }L2 = { anbmcm | n, m 0}Which of these following are false?1) L1 ∩ L2 is CFL.2) L1 ∪ L2 is CFL.3) L1 and L2 are CFL.4) L1 ∩ L2 is CSL...
0 votes
1 answer
59
Converting to weighted code
How to convert (1234)10, decimal number to 2421 weighted code, self-complimentary code.
How to convert (1234)10, decimal number to 2421 weighted code, self-complimentary code.
2 votes
1 answer
60
Views and Tables
What is the difference between a View and a Table? If I create a Table, it will be stored in the database. I mean on the storage space. If I create a View, it will not be stored onto the storage space? Please correct me if I am wrong?
What is the difference between a View and a Table?If I create a Table, it will be stored in the database. I mean on the storage space.If I create a View, it will not be s...
Page: