Assume the statements S1 and S2 given as:
S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same language.
Which of the following is true?
The proof of S1 can be seen in various book of theory of computation but s2 is a problem of category undecidable so a contradiction to this assumption can be easily obtained.
If P & R are regular and also given that if PQ=R, then
If two regular languages when combined do not always produce a regular language.
Which of the following conversion is not possible (algorithmically)?
Not every NDPDA has an equivalent deterministic PDA.
Consider the grammar given below E? E+E  E*E  EE  E/E  E^E  (E)  id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^) , (,) , (+,+) , (*,*) in the operator precedence table constructed for the grammar
This relation is established of basis of the precedence of operators.
Recursively enumerable languages are not closed under:
Recursive languages are closed under the following operations.
The Kleene star L * of L
the concatenation L * o P of L and P
the union L U P
the intersection L ∩ P.
Grammar that produce more than one Parse tree for same sentence is:
an ambiguous grammar is one for which there is more than one parse tree for a single sentence.
Automaton accepting the regular expression of any number of a ‘ s is:
It gives any number of a’s.
Grammars that can be translated to DFAs:
Right linear grammar can be translated to the DFAs.
The language accepted by a Push down Automata:
A known fact that type 2 grammar is accepted by PDA.
Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements?
Recursive languages are closed under the following operations.
The Kleene star L * of L
the concatenation L * o P of L and P
the union L U P
the intersection L ∩ P.
Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 







