Formes de langages et de grammaires

SummaryThis paper is devoted to the study of context-free languages over infinite alphabets. This work can be viewed as a new attempt to study families of grammars, replacing the usual “grammar forms” and giving a new point of view on these questions. A language over an infinite alphabet or I-language appears as being a model for a family of usual languages; an interpretation is an homomorphism from the infinite alphabet to any finite alphabet. Using this notion of interpretation we can associate to each family of I-languages an image, called its shadow, which is a family of usual languages.The closure properties of families, generalizing to infinite alphabets the family of context-free languages, lead to define rational transductions between infinite alphabets or I-transductions, and then, families of I-languages closed under I-transductions, or I-cones. We study here relations between the closure properties of a family of I-languages and these of its shadow. As a result, we obtain that any union closed rational cone of context-free languages, principal or not, is the shadow of a principal I-cone.This work leads to new results about the classical theory of context-free languages. For instance, we prove that any principal rational cone of context-free languages can be generated by a context-free language, whose grammar has only 6 variables. This work also leads to more general considerations about the adequacy of some generating devices to the generated languages. It appears that the context-free grammars are fair, in a sense that we define, for generating context-free languages but that non-expansive context-free grammars are not for generating non-expansive context-free languages. This point of view raises a number of questions.

[1]  Armin B. Cremers,et al.  Context-Free Grammar Forms , 1974, J. Comput. Syst. Sci..

[2]  Maurice Nivat,et al.  Quelques problèmes ouverts en théorie des langages algébriques , 1979, RAIRO Theor. Informatics Appl..

[3]  Maurice Nivat,et al.  Transduction des langages de Chomsky , 1968 .

[4]  Luc Boasson.  The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub-AFL of the Family of Algebraic Languages is Proper , 1973, Inf. Process. Lett..

[5]  Derick Wood,et al.  On Good E0L Forms , 1978, SIAM J. Comput..

[6]  Joffroy Beauquier,et al.  Langages sur des alphabets infinis , 1980, Discret. Appl. Math..

[7]  Hermann A. Maurer,et al.  Propagating Chain-Free Normal Forms for EOL Systems , 1978, Inf. Control..

[8]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[9]  Grzegorz Rozenberg,et al.  Developmental systems and languages , 1972, STOC.

[10]  Sheila A. Greibach,et al.  Control Sets of Context-Free Grammar Forms , 1977, J. Comput. Syst. Sci..

[11]  Jean-Michel Autebert,et al.  Non-prinicipalité du cylindre des langages à compteur , 1977, Mathematical systems theory.

[12]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[13]  Sheila A. Greibach,et al.  Chains of full AFL's , 1970, Mathematical systems theory.

[14]  Jean-Michel Autebert.  Cylindres de langages algebriques , 1978 .

[15]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[16]  Sheila A. Greibach,et al.  The Hardest Context-Free Language , 1973, SIAM J. Comput..

[17]  Egon Balas.  Ranking the facets of the octahedron , 1972, Discret. Math..