Time Left - 15:00 mins
GATE 2024 Theory of computation Rank Booster Quiz 14
Attempt now to get your rank among 47 students!
Question 1
Which of the following problem is not decidable?
Question 2
Which of the following are decidable?
I. Whether the intersection of two regular languages is infinite.
II. Whether a given context–free language is regular
III. Whether two push–down automata accept the same language
IV. Whether a given grammar is context–free
I. Whether the intersection of two regular languages is infinite.
II. Whether a given context–free language is regular
III. Whether two push–down automata accept the same language
IV. Whether a given grammar is context–free
Question 3
An undecidable problem with context-free languages (CFLs) is?
Question 4
L1 is reducible to L2 and L2 is reducible to L3. L3 is decidable. Which of the following can be valid using the above languages L1 and L2 ?
Question 5
Set of all context free languages are?
Question 6
How many of the following problem are decidable?
A) Does a given program ever produce an output.
B) If L is CFL, Then L’ is also CFL.
C) Given a CFG, G , L(G) = {empty}.
D) If L is a recursive language, then , is L’ also recursive.
Question 7
Let P be decidable problem. If P is reducible to a problem X, then X is?
- 47 attempts
- 0 upvotes
- 0 comments
Nov 23GATE & PSU CS
