Does there exist a language which is PSPACE-complete and regular?
There exists a PSPACE-complete regular language if and only if P=PSPACE, which is unknown.

In fact, we can say even more: the language $\{1\}$ is PSPACE-complete if and only if P=PSPACE.