[ut.theory] THEORY NET: NSPACE

arvind@utcsri.UUCP (11/13/87)

Date:         10 Nov 1987 18:08:04-EST (Tuesday)
From: Paul Vitanyi <MCVAX!CWI.NL!PAULV@uunet.uu.net>
Subject:      NSPACE

In the EATCS Bulletin of October 1987 (Number 33), pp. 94-100,
there is an article by Robert Szelepcsenyi ``The method
of forcing for nondeterministic automata'', claiming
the result
     
NSPACE (L(n)) is closed under complement for L(n) >= log n
     
The author refers to an earlier tech rept (in Slovak):
     
``R. Szelepcsenyi, Context-sensitive languages are closed
under complementation, Tech. rept. Komensky University,
April 87.
     
The author does not refer Neil Immerman.