Deterministic Languages and Non-Generators

This communication is devoted to the proof of the following results: the family of context-free non-generators cannot be principal with a deterministic generator. A similar result holds for the largest sub-cone of linear languages as well as of one-counter languages.

[1]  Luc Boasson.  Un langage algébrique particulier , 1979, RAIRO Theor. Informatics Appl..

[2]  Joffroy Beauquier,et al.  Generateurs Algebriques et Systemes de Paires Iterantes , 1979, Theor. Comput. Sci..