Looking for GATE Preparation Material? Join & Get here now!
|
|
THEORY OF COMPUTATION
|
|
Q21. The language {0^p|p not prime} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q22. 0^2^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
Q23. The language {a^i b^j c^j|j>=i} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q24. The language {a^i b^i c^i|n>=1} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q25. The language {a^i b^j c^k|i,j,k>=1} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q26. The language {a^i b^j c^k | i<>j or j<>k or k<>i} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q27. The language {w| w in binary is a prime} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q28. {0^n 1^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
Q29. The languge {0^1 1^j|gcd(i,j)=1} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q30. {w| w has equal number of a's and b's } is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q31.The language {ww| w a string over the alpahabet} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q32. The set of all palidromes over some alphabet is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q33. The languge {a^i b^j c^k d^l| i=0 or j=k=l} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q34. The language {w| w in {0,1}* and w does not have three consecutive 0's} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q35. The language {xwxR|x,w in (0+1)+} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q36. The language {xxRw|s,w in (0+1)+} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q37.The language {w| w is the set of all balanced parenthesis} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q38. The language {w| w is a well-formed regular expression over some alphabet}
is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q39. The language {w| strings not of the form xx, x in (0+1)*} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive
Q40. The languge {w| w is not of the form a^n b^n c^n } is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 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
|
|
|
|
|
|