×

Sur les générateurs algébriques et linéaires. (French) Zbl 0414.68047


MSC:

68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Arnold, A., Latteux, M.: A new proof of two theorems about rational transductions. Theor. Comput. Sci. 8, 261-263 (1979) · Zbl 0401.68057
[2] Beauquier, J.: Générateurs algébriques non-ambigus. Automata, Languages and Programming. Third International Colloquium, S. Michaelson, R. Milner (eds.), pp. 66-73 (1976)
[3] Beauquier, J.: Contribution à l’étude de la complexité structurelle des langages algébriques. Thèse Sc. Math. Université de Paris VI, Paris 1977
[4] Berstel, J.: Transductions and context-free languages. Stuttgart: Teubner 1979 · Zbl 0424.68040
[5] Boasson, L.: Context-free sets of infinite words. Theoretical Computer Science, 4th GI Conference. Lecture Notes in Computer Science, vol. 67, pp. 1-9. Berlin Heidelberg New York: Springer 1979 · Zbl 0402.68054
[6] Boasson, L., Nivat, M: Sur diverses familles de langages fermées par transduction rationnelle. Acta Informat. 2, 180-188 (1973) · Zbl 0242.68037
[7] Boasson, L., Nivat, M.: Adherences of languages. J. Comput. System Sci. (1979 sous presse) · Zbl 0471.68052
[8] Ehrenfeucht, A., Rozenberg, G.: On some context-free languages that are not deterministic ETOL languages. RAIRO Informatique théorique 11, 273-291 (1977) · Zbl 0378.68040
[9] Ehrenfeucht, A., Rozenberg, G., Skyum, S.: A relationship between ETOL and EDTOL languages. Theor. Comput. Sci. 1, 325-330 (1976) · Zbl 0339.68055
[10] Eilenberg, S.: Automata, languages and machines, Volume A. New York: Academic Press 1974 · Zbl 0317.94045
[11] Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Develop. 9, 47-68 (1965) · Zbl 0135.00704
[12] Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Systems Theory 10, 289-303 (1977) · Zbl 0369.68048
[13] Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree Transducers, L systems and two-way machines. Memorandum NR. 187, Twente University (1977) · Zbl 1282.68154
[14] Engelfriet, J., Skyum, S.: Copying theorems. Information Processing Lett. 4, 157-161 (1976) · Zbl 0323.68051
[15] Ginsburg, S.: The mathematical theory of context-free languages. New York: McGraw-Hill 1966 · Zbl 0184.28401
[16] Ginsburg, S., Goldstine, J., Greibach, S.: Uniformly Erasable AFL. J. Comput. System Sci. 10, 165-182 (1975) · Zbl 0325.68042
[17] Greibach, S.: One-way finite visit automata. Theor. Comput. Sci. 6, 175-221 (1978) · Zbl 0368.68059
[18] Latteux, M.: Substitutions dans les EDTOL-systémes ultralinéaires. Information and Control 42, 194-260 (1979) · Zbl 0421.68073
[19] Latteux, M.: Cônes rationnels commutativement clos. RAIRO Informatique théorique 11, 29-51 (1977) · Zbl 0354.68103
[20] Latteux, M.: EDTOL-systèmes ultralinéaires et opérateurs associés. Publication du laboratoire de Calcul de l’Université de Lille I, 100 (1977)
[21] Latteux, M.: Générateurs algébriques et langages EDTOL. Actes du ler Colloque AFCET-SMF de Mathématiques appliquées, tome II, 61-66 (1978)
[22] Leguy, J.: Langages d’image finie et langages bifidèles. Publication n? IT-16-79, Lille 1979
[23] Nivat, M.: Transduction des langages de Chomsky. Ann. Inst. Fourier 18, 339-455 (1968) · Zbl 0313.68065
[24] 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
[25] Nivat, M.: en préparation
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.