By Neil Immerman. SIAM Journal on Computing 17(5), 935–938, 1988.
Author-hosted primary paper: people.cs.umass.edu/~immerman/pub/space.pdf
Theorem 1 and Lemmas 1–2 establish complement closure by counting reachable configurations and verifying complete reachable-set enumeration.
Articles by others on the same topic
There are currently no matching articles.