๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Splitting a Context-Sensitive Set

โœ Scribed by James C. Owings Jr

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
267 KB
Volume
10
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

โœฆ Synopsis

We prove that if A is an infinite, coinfinite context-sensitive set, there exists a deterministic context-sensitive set B such that each of the four sets A n B, A n ~, _4 n B, A n/3 is infinite. This result points up a major difference between the inclusion lattices of the context-sensitive and recursively enumerable sets. * We wish to acknowledge the invaluable aid of Eliot D. Feldman in the development of this paper, consisting of many long and stimulating conversations.

๐Ÿ“œ SIMILAR VOLUMES

Context-Sensitive Visibility
Context-Sensitive Visibility
โœ Antti Valmari; Heikki Virtanen; Antti Puhakka ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB
A generator of context-sensitive languag
A generator of context-sensitive languages
โœ Ben Wegbreit ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 252 KB

The existence of a context-sensitive grammar, G~, which acts as a "generator" of all context-sensitive languages is established. Specifically, G~ has the property that for each context-sensitive language, L, there exists a regular set, RL, and an e-limited gsm, gL, such that L = gz(L(G,,) ~ .RL). It

An hierarchy between context-free and co
An hierarchy between context-free and context-sensitive languages
โœ Takumi Kasai ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 718 KB

Infinite subfamilies ~l, ~ .... , -oq'~o, .W,~ of the family consisting of contextsensitive languages, are introduced such that .2'~ ~z~ ..-C ~| ~o,where 9 LP a is the family of e-free context-free languages, Ld,o is the family of context-sensitive languages, and each L/', is an Abstract Family of L