Looking for GATE Preparation Material? Join & Get here now!
|
|
THEORY OF COMPUTATION
|
|
Q81.The language {ww| w a string over the alpahabet} is
A. regular and infinite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q82. The set of all palidromes over some alphabet is
A. regular and finite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or deterministic context free
Q83. The languge {a^i b^j c^k d^l| i=0 or j=k=l} is
A. regular and finite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q84. The language {w| w in {0,1}* and w does not have three consecutive 0's} is
A. regular and infinite
B. context-free but not regular and not determinitstic context free
C. context-sensitive but not context-free
D.type-0 but not context-sensitive and not recursive
Q85. The language {xwxR|x,w in (0+1)+} is
A. regular and infinite
B. context-free but regular and not deterministic context-free
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q86. The language {xxRw|s,w in (0+1)+} is
A. regular and infinite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q87.The language {w| w is the set of all balanced parenthesis} is
A. regular and finite
B. context-free but not regular and is infinite
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q88. The language {w| w is a well-formed regular expression over some alphabet}
is
A. regular and infinite
B. context-free but regular
C. context-sensitive but not context-free
D.recursive but not context-sensitive
Q89. The language {w| strings not of the form xx, x in (0+1)*} is
A. regular and infinite
B. context-free but not regular or deterministic context-free
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q90. The languge {w| w is not of the form a^n b^n c^n } is
A. regular and infinite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q91.The set {0,1,#}+-{b1#b2#...#bn|n>=1} where bi is the binary representation
of i is
A. regular and infinite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q92. The language {a^i b^j c^k d^l| i= j or j=k} is
A. regular and infinite
B. context-free but not regular or deterministic context free
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q93. The language (a+b)*-{(a^nb^n)^n|n>=1} is
A. regular and finite
B. context-free but not regular or deterministic context-free
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q94. The language {wwRw| w in (a+b)+} is
A. regular and finite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q95. The languge {bi#b(i+1)|bi is in binary } is
A. regular and finite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q96. The languge {wxw| w, x in (c+d)*} is
A. regular and infinite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q97. The languge (a+b)*-{(a^nb^n)^n|n>=1} is
A. regular and infinite
B. context-free but not regular or deterministic context-free
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q98. The languge {a^n b^nc^i| i <> n} is
A. regular and finite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q99. The language {a^n!|n>=1} is
A. regular and infinite
B. context-free but not regular
C. context-sensitive but not context-free or deterministic context-free
D.type-0 but not context-sensitive or recursive
Q100. The languge {w| w has equal number of a's,b's, c's or equal number a's,
b's and d's} is
A. regular and infinite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Result Page:- 1-20 |
21-40 |
41-60 |
61-80 |
81-100 |
101-120 |
121-140 |
141-160 |
161-180 |
181-200 |
201-220 |
221-240 |
|
|
|
|
|
|
|
|
|
|
|
Exciting Offers
|
|
|
|
|
|