Automated Verification: Assignment 3

Due Date: December 2, 1998

Prove by reduction from polynomial space Turing machines that the space(n)-bounded tiling problem is PSPACE-hard.

Note: The assignment needs to be typeset.