cs402 online quiz solved by vu student 2011

[Xpert]

[FONT=&quot]1. [/FONT][FONT=&quot]Two languages are said to belong to same class if they C when they run over an FA, that state (May be final State or not).[/FONT]
2. [FONT=&quot]One language can have ……… CFG(s) (At least one)[/FONT]
3. [FONT=&quot]If an FA has N state then it must accept the word of length (n+1)[/FONT]
4. [FONT=&quot]In pumping lemma theorem (x y^n z) the range of n is (1,2,3,4,………)[/FONT]
5. [FONT=&quot]For a non regular language there exist …… FA (NO)[/FONT]
6. [FONT=&quot]If the intersection of two regular languages is regular then the complement of the intersection of these two languages is also regular (True)[/FONT]
7. [FONT=&quot]According to Myhill Nerode theorem, if L generates finite no. of classes then L is.......(Regular)[/FONT]
8. [FONT=&quot]The language generated by the CFG is called the language ……by the CFG (Produced) [/FONT]
9. [FONT=&quot]If L1 and L2 are regular languages then which statement is NOT true? (L1/L2 is always regular[/FONT])
10. [FONT=&quot]The values of input (say a & b) does not remain same in one cycle due to (clock pulse)[/FONT]
11. [FONT=&quot]The reverse of the string sbfsbb over { sb, f, b } (bsbfsb)[/FONT]
12. [FONT=&quot]In CFG, the symbols that cannot be replaced by anything are called Terminals[/FONT]
13. [FONT=&quot]a^n b^n generates the ………… language (Non regular languages)[/FONT]
14. [FONT=&quot]The production S --> SS | a | b | ^ can be expressed by RE (a+b)+[/FONT]
[FONT=&quot]Any word generated by given CFG can also be expressed by ([/FONT]Syntax tree or Generation
tree or Derivation tree as well)
[FONT=&quot]15. [/FONT][FONT=&quot]Set of all palindromes over {a,b}is regular (false)[/FONT]
16. [FONT=&quot]The grammatical rules which involves meaning of words are called: (semantic)[/FONT]
17. [FONT=&quot]An FA has same initial and final state, then it means that it has no final state. (false)[/FONT]
18. [FONT=&quot]The same non terminals can be written in single line if they have more than one..........(Productions)[/FONT]
19. [FONT=&quot]In pref(Q in R) Q is …… to (than) R (Q is not equal to R)[/FONT]
20. [FONT=&quot]The complement of a regular language is also a regular (True)[/FONT]
21. [FONT=&quot]There is at least one production that has one........on its left side. (None Terminal)[/FONT]
22. [FONT=&quot]For language L defined over {a, b},then L partitions {a, b}* into …… classes (Distinct) [/FONT]