×

zbMATH — the first resource for mathematics

Théorie des magmoides. I. (French) Zbl 0391.68037

MSC:
68Q45 Formal languages and automata
05C05 Trees
08A99 Algebraic structures
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] 1. M. A. ARBIB et Y. GIVE’ON, Algebra Automata Information and Control, vol.12, 1968, p. 331-370. Zbl0164.32201 MR276008 · Zbl 0164.32201
[2] 2. A. ARNOLD, Systèmes d’équations dans le magmoïde. Ensembles rationnels et algébriques d’arbres, Thèse d’État, Lille, 1977.
[3] 3. A. ARNOLD et M. DAUCHET, Bimorphismes, S-morphismes et bi-S-morphismes, Publication du Laboratoire de Calcul, n^\circ 59, 1975.
[4] 4. A. ARNOLD et M. DAUCHET, Théorie des magmoïdes, Publication du Laboratoire de Calcul de Lille, 1977.
[5] 5. G. BOUDOL, Langages polyadiques algébriques. Théorie des schémas de programme : sémantique de l’appel par valeur, Thèse 3e cycle, Université Paris-VII, 1975.
[6] 6. W. S. BRAINERD, Tree Generating Regular Systems, Information and Control, vol. 14, 1969, p. 217-231. Zbl0169.31601 MR239875 · Zbl 0169.31601
[7] 7. P. M. COHN, Universal Algebra, Harper and Row, New York, 1965. Zbl0141.01002 MR175948 · Zbl 0141.01002
[8] 8. G. COUSINEAU, Les arbres à feuilles indicées : un cadre algébrique pour l’étude des structures de contrôle, Thèse d’État, Université Paris-VII, 1977.
[9] 9. M. DAUCHET, Transductions de forêts. Bimorphismes de magmoïdes, Thèse d’État, Lille, 1977.
[10] 10. P. DOWNEY, Formal Languages and Recursion Schemes, Ph. D. Thesis, Harvard University, 1974.
[11] 11. S. EILENBERG et J. B. WRIGHT, Automata in General Algebras, Information and Control, vol. 11, 1967, p. 217-231. Zbl0175.27902 MR223285 · Zbl 0175.27902
[12] 12. C. C. ELGOT, Matricial Theories, J. Alg., vol. 42, 1976, p. 391-421. Zbl0361.18004 MR430017 · Zbl 0361.18004
[13] 13. J. ENGELFRIET et E. M. SCHMIDT, 10 and 01, Daimi Report PB 47, University of Aarhus, Danemark, 1975.
[14] 14. J. A. GOGUEN, J. W. THATCHER, E. G. WAGNER et J. B. WRIGHT, Initial Algebra Semantics and Continuons Algebras, J. Assoc. Comput. Mach., vol. 24, 1977, p. 68-95. Zbl0359.68018 MR520711 · Zbl 0359.68018
[15] 15. G. JACOB, Substitution dans les arbres et non-déterminisme. Appel par nomet appel synchrone in Les Arbres en Algèbre et en Programmation, 2nd Colloque de Lille, 1977, p. 162-198. Zbl0381.18014 · Zbl 0381.18014
[16] 16. F. W. LAWVERE, Functorial Semantics of Algebraic Theorics, Proc. Nat. Acad. Sc. U.S.A., vol. 50, 1963, p. 869-872. Zbl0119.25901 MR158921 · Zbl 0119.25901
[17] 17. E. LILIN, S-transducteur s de forêts, Publications du Laboratoire de Calcul de Lille, n^\circ 101, 1977.
[18] 18. T.S.E. MAIBAUM, A generalized Approach to Formal Languages, J. Comput. System Sc, vol. 8, 1974, p. 402-432. Zbl0361.68113 MR366112 · Zbl 0361.68113
[19] 19. M. NIVAT, Langages algébriques sur le magma libre et sémantique des schémas de programme in Automata, Languages and Programming, 1st colloquium, M. NIVAT, éd., North Holland, 1973, p. 293-307. Zbl0279.68010 MR383813 · Zbl 0279.68010
[20] 20. M. NIVAT, On the Interprétation of Polyadic Recursive Programs Schemes, Symposia Mathematica (Rome), vol. 15, 1975, p. 255-281. Zbl0346.68041 MR391563 · Zbl 0346.68041
[21] 21. C. PAIR et A. QUERF, Définition et étude des bilangages réguliers, Information and Control, vol. 13, 1968, p. 565-593. Zbl0181.01603 MR250803 · Zbl 0181.01603
[22] 22. B. K. ROSEN, Tree-Manipulating Systems and Church-Rosser Theorem, J. Assoc. Comput. Mach., vol. 20, 1973, p. 160-187. Zbl0267.68013 MR331850 · Zbl 0267.68013
[23] 23. W. C. ROUNDS, Context-Free Grammars on Trees, 1st A.C.M. Symp. on Theory of Computing, 1969, p. 143-148. · Zbl 1282.68151
[24] 24. W. C. ROUNDS, Mappings and grammars on trees, Math. Systems Theory, vol. 4, 1970p. 257-287. Zbl0203.30103 MR269440 · Zbl 0203.30103
[25] 25. J. W. THATCHER, Tree Automata : an Informal Survey in Currents in the Theory of Computing, A. V. AHO, éd., Prentice Hall, 1973, p. 143-178. MR426502
[26] 26. J. TIURYN, Fixed-Points and Algebras with Infinitely Long Expressions. 1re partie : Mathematica! Foundations of Computer Science, Lecture Notes in Comput. Science, n^\circ 53, 1977, p. 513-522; 2e partie : Fundamentals of Computation Theory, Lecture Notes in Comput. Science, n^\circ 56, 1977, p. 332-339. Zbl0392.68013 · Zbl 0392.68013
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.