Space hierarchy theorem revised
We show that, for an arbitrary function h(n) and each recursive function e(n), that are separated by a nondeterministically fully space constructible g(n), such that h(n) E Q(g(n)) but l(n) Q(g(n)), there exists a unary language L in NSPACE(h(n)) that is not contained in NSPACE(l(n)). The same holds for the deterministic case. The main contribution to the well-known Space Hierarchy Theorem is that (i) the language L separating the two space classes is unary (tally), (ii) the hierarchy is independent of whether h(n) or l(n) are in Omega(log n) or in o(log n), (iii) the functions h(n) or l(n) themselves need not be space constructible nor monotone increasing, (iv) the hierarchy is established both for strong and weak space complexity classes. This allows us to present unary languages in such complexity classes as, for example, NSPACE(log log n (.) log* n) \ NSPACE(log log n), using a plain diagonalization. (C) 2002 Elsevier Science B.V. All rights reserved.
space complexity computational complexity