Share  Bookmark

 Download from

Open Repository and Bibliography  University of Liège via Open Repository and Bibliography  University of Liège (Conference object, 2011)


[1] I. Anderson. On primitive sequences. Journal London Math. Soc, 42:137148, 1967.
[2] I. Anderson. Combinatorics of finite sets. Dover Publications, 2002.
[3] E. Bach and J. Shallit. Algorithmic Number Theory, volume 1. MIT Press, 1997.
[4] J. Berstel and L. Boasson. The set of Lyndon words is not contextfree. Bull. EATCS, 63:139140, 1997.
[5] S. Constantinescu and L. Ilie. Fine and Wilf's theorem for Abelian periods. Bull. EATCS, 89:167170, 2006.
[6] R. Crandall and C. Pomerance. Prime Numbers: A Computational Perspective. Springer, 2nd edition, 2005.
[7] E. Czeizler, L. Kari, and S. Seki. On a special class of primitive words. Theoretical Computer Science, 411:617 630, 2010.
[8] N. de Bruijn, C. van Ebbenhorst Tengbergen, and D. Kruyswijk. On the set of divisors of a number. Nieuw Arch. Wiskunde, 23:191193, 1951.
[9] M. Domaratzki. TrajectoryBased Operations. PhD thesis, Queen's University, 2004.
[10] P. Do¨ mo¨ si, S. Horva´th, M. Ito, L Ka´szonyi, and M. Katsura. Formal languages consisting of primitive words. In Z. E´ sik, editor, Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 2327, 1993, Proceedings, volume 710 of Lecture Notes in Computer Science, pages 194203. Springer, 1993.