The family of languages satisfying "Bar-Hillel's" lemma

[1]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[2]  Y. BAR-HILLEL,et al.  On formai properties oî simple phreise structure grammars , 1961 .

[3]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.