Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We prove that if A is an infinite, coinfinite context-sensitive set, there exists adeterministic context-sensitive set B such that each of the four sets , is infinite. This result points up a major difference between the inclusion lattices of the context-sensitive and recursively enumerable sets.