A generator of context-sensitive languages

Authors:
Ben Wegbreit
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1969

Citing 0
Cited 4

Abstract families of length-preserving processors

Journal of Computer and System Sciences
Comparing complexity classes

Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs

Journal of Computer and System Sciences
Tape-bounded turing acceptors and principal AFLs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The existence of a context-sensitive grammar, G"u, which acts as a ''generator'' of all context-sensitive languages is established. Specifically, G"u has the property that for each context-sensitive language, L, there exists a regular set, R"L, and an e-limited gsm, g"L, such that L=g"L(L(G"u)@?R"L). It follows that the family of context-sensitive languages is a principal AFL. An analogous result is proved for deterministic contextsensitive languages.