We give in this paper additional answers to questions of Lescow and Thomas (A decade of
An hierarchy between context-free and context-sensitive languages
β Scribed by Takumi Kasai
- Publisher
- Elsevier Science
- Year
- 1970
- Tongue
- English
- Weight
- 718 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
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 Languages, i.e., closed under +, -, U, inverse-homomorphism, r-free homomorphism, and intersection with regular sets. Each language of .W, is defined by a grammar, called a state grammar, that may be thought of as a context-free grammar with states.
π SIMILAR VOLUMES
A language L over a ΓΏnite alphabet is called growth-sensitive if forbidding any set of subwords F yields a sub-language L F whose exponential growth rate is smaller than that of L. It is shown that every (essentially) ergodic non-linear context-free language of convergent type is growth-sensitive. "
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.