Looking for GATE Preparation Material? Join & Get here now!
|
|
THEORY OF COMPUTATION
|
|
Q61. The language {w| w has equal number of a's, b's and c's } 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
Q62. The language {0^n1^n|n>=1} U {0^n 1^2n|n>=1} is
A. regular but not finite
B. context-free but not regular
C. context-sensitive but not context-free
D.recursive but not context-sensitive
Q63. The language {0^n1^n|n>=1} U {0^n 1^2n|n>=1} is
A. regular and finite
B. deterministic context-free but not regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q64. The language {0^n1^n|n>=1} U {0^n 1^2n|n>=1} is
A. regular but not finite
B. context-free but not deterministic context free
C. context-sensitive but not context-free
D.type-0or recursive but not context-sensitive
Q65. {0^i 1^ja2^i|j>=i} U {0^i 1^jb2^i|j>=i} is
A. regular and not finite
B. context-free but not deterministic context free
C. context-sensitive but not context-free
D.type-0 but nor recursive
Q66. {0^i 1^ja2^i|j>=i} U {0^i 1^jb2^i|j>=i} 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
Q 67. The language {a^n!|n>=1} 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 recursive
Q68. The language {a^ceil(log2n)|n>=1} is
A. regular and also deterministic context free
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q69. {0^n 1^n^2|n>=1} is
A. regular and not finite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q70. The langugae {a^p|p prime} is
A. regular and not finite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or deterministic context free
Q71. The language {0^p|p not prime} 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
Q72. 0^2^n|n>=1} is
A. regular and not finite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q73. The language {a^i b^j c^j|j>=i} 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
Q74. The language {a^i b^i c^i|n>=1} is
A. regular and not deterministic context free
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive or recursive
Q75. The language {a^i b^j c^k|i,j,k>=1} is
A. regular and infinite
B. context-free but regular
C. context-sensitive but not context-free
D.recursive but not context-sensitive
Q76. The language {a^i b^j c^k | i<>j or j<>k or k<>i} 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
Q77. The language {w| w in binary is a prime} is
A. regular and not finite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q78. {0^n 1^n|n>=1} is
A. regular and not finite
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 or recursive but not context-sensitive
Q79. The languge {0^1 1^j|gcd(i,j)=1} is
A. regular and not infinite
B. context-free but regular
C. context-sensitive but not context-free
D.recursive but not context-sensitive
Q80. {w| w has equal number of a's and b's } 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 deterministic context-free
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
|
|
|
|
|
|