If we denote by SPACE(t(n)), the set of all problems that can be solved by Turing machines using O(t(n)) space for some function t of the input size n, then we can define PSPACE formally as[REF] .
PSPACE is a strict superset of the set of context-sensitive languages.