1 | Let R1 and R2 be regular sets defined over alphabet ∑ then
(a.) R1 UNION R2 is regular |
2 |
Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar. (a.) L = {aaaa,aabb,bbaa,bbbb} |
3 | Give a production grammar that specified language L = {ai b2i >= 1}
(a.) {S->aSbb,S->abb} |
4 | Which of the following String can be obtained by the language L = {ai b2i / i >=1}
(a.) aaabbbbbb |
5 | Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.
(a.) {S->bS,S->b,S->aA,S->bA,A->aB,B->bB,B->aS,S->a} |
6 | The production Grammar is {S->aSbb,S->abb} is
(a.) type-3 grammar |
7 | Which of the following statement is wrong?
(a.) A Turing Machine can not solve halting problem. |
8 | Which of the following statement is wrong ?
(a.) Recursive languages are closed under union. |
9 | Which of the following statement is wrong ?
(a.) Every recursive language is recursively enumerable |
10 | Which of the following statement is true ?
(a.) All languages can be generated by CFG |
11 | Recursively enumerable languages are not closed under
(a.) Complementation |
12 | Regular expression (x/y)(x/y) denotes the set
(a.) {xy,xy} |
13 | Regular expression x/y denotes the set
(a.) {x,y} |
14 | The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1)
(a.) 1 + 0(1+0)* |
15 | The regular expressions denote zero or more instances of an x or y is
(a.) (x+y) |
16 | The regular expression have all strings in which any number of 0′s is followed by any number of 1′s followed by any number of 2′s is :
(a.) (0+1+2)* |
17 | The regular expression have all strings of 0′s and 1′s with no two consecutive 0′s is :
(a.) (0+1) |
18 | The regular expression with all strings of 0′s and 1′s with atleast two consecutive 0′s, is :
(a.) 1 + (10)* |
19 | Which of the following is NOT the set of regular expression R = (ab + abb)* bbab
(a.) ababbbbab |
20 | Which string can be generated by S->aS/bA, A->d/ccA
(a.) aabccd |
21 | The regular sets are closed under
(a.) Union |
22 | Which of the following statement is wrong ?
(a.) the regular sets are closed under intersection |
23 | A FSM can be considered, having finite tape length without rewinding capability and unidirectional tape movement
(a.) Turing machine |
24 | Any given transition graph has an equivalent
(a.) regular |
25 | The intersection of CFL and regular languages
(a.) is always regular |