×

Langages sur des alphabets infinis. (French) Zbl 0443.68058


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Autebert, J.-M.; Beauquier, J.; Boasson, L.; Nivat, M., Quelques problèmes ouverts en théorie des langages algébriques, RAIRO Informatique Théorique, 13, 363-379 (1979) · Zbl 0434.68056
[2] J.-M. Autebert, J. Beauquier et L. Boasson, Formes de langages et formes de grammaires, soumis au J. Comput. System Sci.; J.-M. Autebert, J. Beauquier et L. Boasson, Formes de langages et formes de grammaires, soumis au J. Comput. System Sci. · Zbl 0467.68065
[3] J.-M. Autebert, J. Beauquier et L. Boasson, Limites de langages, en préparation.; J.-M. Autebert, J. Beauquier et L. Boasson, Limites de langages, en préparation.
[4] Berstel, J., Transductions and Context-free Languages (1979), Teubner: Teubner Stuttgart · Zbl 0424.68040
[5] L. Boasson et M. Nivat, Adherences of languages, à paraître dans le J. Comput. System Sci.; L. Boasson et M. Nivat, Adherences of languages, à paraître dans le J. Comput. System Sci. · Zbl 0471.68052
[6] Chomsky, N.; Schützenberger, M.-P., The algebraic theory of context-free languages, (Brafford; Hirschberg, Computer Programming and Formal Systems (1963), North Holland: North Holland Amsterdam), 118-161 · Zbl 0148.00804
[7] Cousineau, G.; Rifflet, J.-M., Langages d’interprétation des schémes récursifs, RAIRO Informatique Théorique, 9, 21-42 (1975) · Zbl 0331.68007
[8] Cremers, A. B.; Ginsburg, S., Context-free grammar forms, J. Comput. System Sci., 11, 86-117 (1975) · Zbl 0328.68071
[9] Garland, S. J.; Luckham, F. C., Program schemes, recursion schemes and formal languages, J. Comput. System Sci., 7, 119-160 (1973) · Zbl 0277.68010
[10] Greibach, S. A., Chains of full AFL’s, Mathematical System Theory, 4, 231-242 (1970) · Zbl 0203.30102
[11] Greibach, S. A., The hardest context-free language, SIAM J. Computing, 2, 304-310 (1973) · Zbl 0278.68073
[12] Greibach, S. A., Control sets on context-free grammar forms, J. Comput. System Sci., 15, 35-98 (1977) · Zbl 0359.68093
[13] Harrison, M., Introduction to Formal Language Theory (1979), Addison Wesley: Addison Wesley Reading, MA
[14] Nivat, M., Mots infinis engendrés par une grammaire algébrique, RAIRO Informatique Théorique, 11, 311-327 (1977) · Zbl 0371.68025
[15] Nivat, M., Sur les ensembles de mots infinis engendrés par une grammaire algébrique, RAIRO Informatique Théorique, 12, 259-278 (1978) · Zbl 0387.68050
[16] M. Nivat, On the synchronisation of processus, à paraître.; M. Nivat, On the synchronisation of processus, à paraître.
[17] Ogden, W., A helpful result for proving inherent ambiguity, Mathematical System Theory, 2, 191-194 (1967) · Zbl 0175.27802
[18] Parikh, R. J., On context-free languages, J. Assoc. of Computing Machinery, 13, 570-580 (1966) · Zbl 0154.25801
[19] Roucairol, G., Contribution à l’étude des équivalences syntaxiques et transformations de programmes parallèles, Thèse d’Etat de l’Université de Paris, VI (1978)
[20] Shamir, E., A representation theorem for algebraic and context-free power series in noncommutating variables, Information and Control, 11, 239-254 (1967) · Zbl 0165.02302
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.