PSPACE is strictly the super set of: – McqOptions

MCQOPTIONS

1.	PSPACE is strictly the super set of:
A.	Regular language
B.	Context free language
C.	Context Sensitive Language
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion

No Comment Found

Related MCQs

Which of the following PSPACE can be characterized into?
Complement of all the problems in PSPACE is ________
Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine.
Statement : All PSPACE problems can be reduced to PSPACE-complete problems.State true or false:
NL ∈ PSPACE ∈ EXPSPACEThe given relation involves which of the following theorems?a) Space hierarchy theoremb) Savitch’s theoremc) Both (
Correct the given order:NL∈ P∈ NP∈ PH∈ PSPACE
COMPLEMENT_OF_ALL_THE_PROBLEMS_IN_PSPACE_IS_________?$
Which_of_the_following_PSPACE_can_be_characterized_into?$
Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine?
Statement : All PSPACE problems can be reduced to PSPACE-complete problems.