Question 41 : A CFG is closed under
1. Union
2. Kleene star
3. Concatenation
4. None of the mentioned
View Answer   Discuss with Members

Question 42 : A regular Grammar is a
1. CFG
2. Non CFG
3. English Grammar
4. None of the mentioned
View Answer   Discuss with Members

Question 43 : Push down automata accepts which language
1. Context sensitive language
2. Context free language
3. Recursive language
4. None of the mentioned
View Answer   Discuss with Members

Question 44 : The context free grammar S -> A111|S1, A -> A0 | 00 is equivalent to
1. {0n1? | n=2, m=3}
2. {0n1? | n=1, m=5}
3. {0n1? | n should be greater than two and m should be greater than four}
4. None of these
View Answer   Discuss with Members

Question 45 : Which of the following statement is false?
1. The CFG can be converted to Chomsky normal form
2. The CFG can be converted to Greibach normal form
3. CFG is accepted by push down automata
4. None of the mentioned
View Answer   Discuss with Members

Question 46 : A context free language is called ambiguous if
1. It has 2 or more left derivations for some terminal string ? ? L (G)
2. It has 2 or more right derivations for some terminal string ? ? L (G)
3. Both of th ementioned
4. None of the mentioned
View Answer   Discuss with Members

Question 47 : Assume statements S1 and S2 defined as : S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2 : The set of all Turing machines is countable. Which of the following is true ?
1. S1 is correct and S2 is not correct.
2. Both S1 and S2 are correct.
3. Both S1 and S2 are not correct.
4. S1 is not correct and S2 is correct.
View Answer   Discuss with Members

Question 48 : 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 ?
1. I only
2. II only
3. Both I and II
4. Neither I nor II
View Answer   Discuss with Members

Question 49 : The language accepted by a Push down Automata
1. Type0
2. Type1
3. Type2
4. Type3
View Answer   Discuss with Members

Question 50 : Grammars that can be translated to DFAs:
1. Left linear grammar
2. Right linear grammar
3. Generic grammar
4. All of the mentioned
View Answer   Discuss with Members