Nondeterministic Space is Closed under Complementation (Q3821586)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4094818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic Space is Closed under Complementation |
scientific article; zbMATH DE number 4094818 |
Statements
Nondeterministic Space is Closed under Complementation (English)
0 references
1988
0 references
nondeterminism
0 references
complexity classes
0 references
space complexity
0 references
context-sensitive languages
0 references
0.7904641032218933
0 references
0.7872859239578247
0 references
0.7765209674835205
0 references
0.7721403241157532
0 references
A break-through result is proved: all nondeterministic space complexity classes are closed under complementation. In symbols: \(NSPACE(s(n))=co\)- NSPACE(s(n)). As the special case \(s(n)=n\) one obtains that the context- sensitive languages (the LBA languages) are closed under complementation, answering a well-known open problem by Kuroda from 1964. The proof is astonishingly simple, it uses a nondeterministic, inductive counting technique. The result was independently and at the same time shown by \textit{R. Szelepcsényi} in the Bulletin of the EATCS 33, 96-100 (1987; Zbl 0664.68082).
0 references