1. 1. ARNOLD A. et NIVAT M., Non Deterministic Recursive Program Schemes, in Fundamentals of Computation Theory, Poznan, 1977, M. KARPINSKI, éd., Lecture Notes in Computer Science, n° 56, Springer-Verlag, 1977, p. 12-21.5021200361.68020
2. 2. ARNOLD A. et NIVAT M., The Metric Space of Infinite Trees. Algebraic and Topological Properties, Rapport I.R.I.A.-Laboria, n° 323, 1978.
3. 3. BOASSON L. et NIVAT M., Adherences of Languages, J. Comput. Sys. Sci. vol. 20, 1980, p. 285-309.5848630471.68052
4. 4. EILENBERG S. et MONTGOMERY D., Fixed Point Theorems for Muhi-Valued Transformations, Amer. J. Math., vol. 68, 1946, p. 214-222.166760060.40203
5. 5. KAHN G., The Semantics of a Simple Language for Parallel Processing, Proc. I.F.I.P. Congress, 1974.0299.68007