1. Allouche J.-P.: Sur la complexité des suites infinies. Bull. Belg. Math. Soc. 1, 133–143 (1994)
2. Arkin E.M., Bender M.A., Demaine E.D., Demaine M.L., Mitchell J.S.B., Sethia S., Skiena S.S.: When can you fold a map?. Comput. Geom. Theory Appl. 29(1), 23–46 (2004)
3. Cardinal, J., Demaine, E.D., Demaine, M.L., Imahori, S., Langerman, S., Uehara, R.: Algorithmic folding complexity. In: 20th international symposium on algorithms and computation (ISAAC 2009). Lecture Notes in Computer Science, vol. 5856, pp. 452–461. Springer, Berlin (2009). (Extended abstract was presented at 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), 143–144, 2009.)
4. chosotec. The making of Mens et Manus (in origami), vol. 1 (2007). http://techtv.mit.edu/collections/chosetec/videos/361-the-making-of-mens-et-manus-in-origami-vol-1
5. Dekking, M.: Michel Mendès France, Alf van der Poorten. Folds! Math. Intell. 4, 130–138 (1982) (173–181, 190–195)