Three generators for minimal writing-space computations
Burckel, Serge ; Morillon, Marianne
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000), p. 131-138 / Harvested from Numdam
Publié le : 2000-01-01
@article{ITA_2000__34_2_131_0,
     author = {Burckel, Serge and Morillon, Marianne},
     title = {Three generators for minimal writing-space computations},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {34},
     year = {2000},
     pages = {131-138},
     mrnumber = {1774305},
     zbl = {0962.68127},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2000__34_2_131_0}
}
Burckel, Serge; Morillon, Marianne. Three generators for minimal writing-space computations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) pp. 131-138. http://gdmltest.u-ga.fr/item/ITA_2000__34_2_131_0/

[1] N. G. De Bruijn, A combinatorial problem. Indag. Math. 8 (1946) 461-467. | Zbl 0060.02701

[2] S. Burckel, Closed Iterative Calculus. Theoret. Comput. Sci. 158 (1996) 371-378. | MR 1388976 | Zbl 0871.68087

[3] S. Burckel and M. Morillon, Computing Without Copying (submitted).

[4] S. Piccard, Sur les fonctions définies dans les ensembles finis quelconques. Fund. Math. 24 (1935) 298-301. | JFM 61.0230.02