Looking for GATE Preparation Material? Join & Get here now!
|
|
THEORY OF COMPUTATION
|
|
Q41.The set {0,1,#}+-{b1#b2#...#bn|n>=1} where bi is the binary representation
of i is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q42. The language {a^i b^j c^k d^l| i= j or j=k} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q43. The language (a+b)*-{(a^nb^n)^n|n>=1} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q44. The language {wwRw| w in (a+b)+} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q45. The languge {bi#b(i+1)|bi is in binary } is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q46. The languge {wxw| w, x in (c+d)*} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q47. The languge (a+b)*-{(a^nb^n)^n|n>=1} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q48. The languge {a^n b^nc^i| i <> n} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q49. The language {a^n!|n>=1} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q50. 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
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q51. The language {a^i b^j c^k| i=j or j=k} is
A. regular but not finite
B. deterministic context-free but not regular
C. context-sensitive but not regular
D.type-0 but not context-sensitive
Q52. The language {a^i b^j c^k|k=min(i,j)} is
A. regular but not finite
B. context-free but deterministic context free
C. context-sensitive but not deterministic context-free
D.recursive but not context-sensitive
Q53. The language {a^i b^j c^k| k= max(i,j)} os
A. regular but not context-free
B. context-free but not regular
C. context-sensitive but not context-free
D.recursive but not context-sensitive
Q54. The language {a^n b^n c^i| i<>n} is
A. regular but not finite
B. context-free but not regular
C. context-sensitive but not deterministic context-free
D.recursive but not context-sensitive
Q55. The language {a^i b^j c^k| i<=k<=2j} is
A. regular but not finite
B. context-free but not deterministic context-free
C. context-sensitive but not context-free
D.recursive but not context-sensitive
Q56. The language {a^i b^j c^k|i<j<k} is
A. regular but not finite
B. context-free but not regular
C. context-sensitive but not context-free
D.recursive or type-0 but not context-sensitive
Q57. The language {a^i b^j c^k|i+j>=k} is
A. regular but not finite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q58. The langugae {a^i b^j c^k|k<=i or k<=j} is
A. regular but not finite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q59.{a^i b^i c^j d^j|i,j>=1} is
A. regular but not finite
B. context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q60. The language {a^i b^i c^j d^2 e^3i|i,j>=1} is
A. regular and finite
B. context-free but not regular
C. context-sensitive but not context-free
D.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
|
|
|
|
|
|