On “inherently context-sensitive” languages - An application of complexity cores

Authors:
Volker Diekert;Ronald V. Book
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1991

Citing 5
Cited 0

The density and complexity of polynomial cores for intractable sets

Information and Control
The existence and density of generalized complexity cores

Journal of the ACM (JACM)
The method of forced enumeration for nondeterministic automata

Acta Informatica
Nondeterministic space is closed under complementation

SIAM Journal on Computing
Generalized complexity cores and levelability of intractable sets (np-complete, polynomial immunity, exponential-time, k-creative, approximation)

Generalized complexity cores and levelability of intractable sets (np-complete, polynomial immunity, exponential-time, k-creative, approximation)

Quantified Score

Hi-index	0.89

Visualization

Abstract

The concept of an ''inherently context-sensitive language'' is introduced. It is shown that every context-sensitive language that is not in the Boolean closure of the context-free languages has a subset that is inherently context-sensitive.