×

Morphismes et bimorphismes d’arbres. (French) Zbl 0486.68072


MSC:

68Q45 Formal languages and automata
05C05 Trees
08A99 Algebraic structures
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Arnold, A.; Dauchet, M., Un théorème de duplication pour les forêts algébriques, J. Comput. System. Sci., 13, 223-244 (1976) · Zbl 0335.68050
[2] Arnold, A.; Dauchet, M., Transductions de forêts reconnaissables monadiques. Forêts corégulières, R.A.I.R.O. Informatique Théorique, 10, 5-28 (1976) · Zbl 0363.68104
[3] Arnold, A.; Dauchet, M., Transductions inversibles de forêts, (Thése de 3éme cycle M. Dauchet, 1 (1975), Université de Lille) · Zbl 0363.68104
[4] Arnold, A.; Dauchet, M., Bitransductions de forêts, Proc. 3rd Conference on Automata Langauges and Programming, 74-86 (1976), Edinburg · Zbl 0363.68104
[5] Arnold, A.; Dauchet, M., Une relation d’équivalence décidable sur la classe des forêts reconnaissables, Math. Systems Theory, 12, 103-128 (1978) · Zbl 0392.68065
[6] Arnold, A.; Dauchet, M., Un théorème de Chomsky-Schutzenberger pour les forêts algébriques, Calcolo, 14, 161-184 (1977) · Zbl 0363.68105
[7] Arnold, A.; Dauchet, M., Forêts algébriques et homomorphismes inverses, Information and Control, 37, 182-196 (1978) · Zbl 0395.68073
[8] Arnold, A.; Dauchet, M., Théorie des magmoïdes (1), R.A.I.R.O. Informatique Théorique, 12, 3, 235-257 (1979) · Zbl 0391.68037
[9] Arnold, A.; Dauchet, M., Théorie des magmoïdes (2), R.A.I.R.O. Informatique Théorique, 13, 2, 135-154 (1979) · Zbl 0443.68053
[10] Arnold, A.; Dauchet, M., Sur l’inversion des morphismes d’arbres, (Proc. 5th Automata Languages and Programming. Proc. 5th Automata Languages and Programming, Lecture Notes in Computer Science, 62 (1978), Springer: Springer Berlin), 26-35, Udine · Zbl 0385.68059
[11] (Arnold, A.; Dauchet, M.; Jacob, G., 1er Colloque sur les Arbres en Algèbre et en Programmation (1976), Université de Lille 1)
[12] (Arnold, A.; Dauchet, M.; Jacob, G., 2ème Colloque sur les Arbres en Algèbre et en Programmation (1977), Université de Lille 1)
[13] Arnold, A., Systèmes d’équations dans le magmoïde. Ensembles rationnels et algébriques d’arbres, (Thése de Doctorat d’Etat (1977), Université de Lille 1)
[14] Autebert, J. M.; Beauquier, J., Une caractérisation des générateurs standard, R.A.I.R.O. Informatique Théorique, 63-83 (1974) · Zbl 0294.68031
[15] Baker, B. S., Tree-transductions and families of tree-languages, Proc. 5th A.C.M. Conference on Theory of Computing, 200-206 (1973) · Zbl 0319.68040
[16] Benson, B. D., The basic algebraïc structures in categories of derivations, Information and Control, 28, 1-29 (1975) · Zbl 0304.68083
[17] Boasson, L., On the largest (full) sub-AFL of the context-free languages, Math. Foundations Comput. Sci., 194-198 (1975) · Zbl 0328.68072
[18] Boasson, L.; Nivat, M., Sur diverses familles de langages fermées par transduction rationnelle, Acta Informat., 2, 180-188 (1973) · Zbl 0242.68037
[19] Boudol, G., Langages polyadiques algébriques. Théorie des schémas de programmes: Sémantique de l’appel par valeur, Thèse de 3ème cycle (1975), Paris
[20] Brainerd, W. S., Tree-generating regular systems, Information and Control, 14, 217-231 (1969) · Zbl 0169.31601
[21] Dauchet, M., Transductions de forêts. Bimorphismes de magmoïdes, (Thèse de Doctorat d’Etat (1977), Université de Lille 1) · Zbl 0382.68062
[22] Eilenberg, S.; Wright, J. B., Automata in general algebras, Information and Control, 11, 217-231 (1967) · Zbl 0175.27902
[23] Engelfriet, J., A hierarchy of tree transducers, (Proc. 3ème Colloque sur les Arbres en Algèbre et en Programmation (1978), Université de Lille 1), 103-106 · Zbl 0386.68070
[24] Engelfriet, J., Bottom-up and top-down tree transformations. A comparison, Math. Systems Theory, 9, 198-231 (1975) · Zbl 0335.68061
[25] Fischer, M. J., Grammars with macro-like productions, Proc. 9th I.E.E.E. Symposium on Switching and Automata Theory, 131-142 (1968)
[26] Ginsburg, S.; Greibach, S., Studies in abstract families of languages, Mem. Amer. Math. Soc., 113, 285-296 (1966)
[27] Ginsburg, S.; Greibach, S., Principal AFL, J. Comput. System Sci., 4, 308-338 (1970) · Zbl 0198.03102
[28] Goguen, J. A.; Thatcher, J. W., Initial algebra semantics, Proc. 15th I.E.E.E. Symposium on Switching and Automata Theory, 63-77 (1974)
[29] Latteux, M., ‘Cônes rationnels commutativement clos, R.A.I.R.O. Informatique Théorique, 11, 1, 29-51 (1977) · Zbl 0354.68103
[30] Nivat, M., Transductions des langages de Chomsky, Ann. Inst. Fourier (Grenoble), 18, 339-456 (1968) · Zbl 0313.68065
[31] Nivat, M., On the interpretation of recursive program schemas, Rapport I.R.I.A. No.84 (1974)
[32] Ogden, W. F.; Rounds, W. C., Composition of \(n\) tree transducers, Proc. 4th A.C.M. Conference on Theory of Computing, 198-206 (1972) · Zbl 0358.68089
[33] Rounds, W. C., Trees, transducers and transformations, (Ph.D. Dissertation (1968), Standord University) · Zbl 0203.30103
[34] Rounds, W. C., Context-free grammars on trees, Proc. 1st A.C.M. Conference on Theory of Computing, 143-148 (1969) · Zbl 1282.68151
[35] Rounds, W. C., Tree-oriented proofs of some theorems on context-free and indexed languages, Proc. 2nd A.C.M. Conference on theory of Computing, 109-116 (1970)
[36] Rounds, W. C., Mappings and grammars on trees, Math. Systems Theory, 4, 257-287 (1967) · Zbl 0203.30103
[37] Takahashi, M., Primitive transformations of regular sets and recognizable sets, (Nivat, Automata, Languages and Programming (1973), North-Holland: North-Holland Amsterdam), 475-480 · Zbl 0281.94037
[38] Takahashi, M., Rational relations of binary trees, Proc. 4th Conference on Automata, Languages and Programming (1977), Turku · Zbl 0366.94060
[39] Thatcher, J. W., \(Generalized^2\) sequential machine maps, J. Comput. System. Sci., 4, 339-367 (1970) · Zbl 0198.03303
[40] Thatcher, J. W., Tree automata: An informal survey, (Aho, A. V., Currents in the Theory of Computing (1973), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ), 143-178
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.