1. [1] Allouche, Jean-Paul; Shallit, Jeffrey Automatic Sequences: Theory, Applications Generalizations, Cambridge University Press, 2003
2. Finding the growth rate of a regular or context-free language in polynomial time;Gawrychowski, Paweł;Developments in Language, Theory. 12th International Conference, DLT 2008, Kyoto, Japan, September 16–19, 2008. Proceedings,2008
3. [3] Hopcroft, John E.; Ullman, Jeffrey D. Introduction to Automata Theory, Languages and Computation, Addison-Wesley Series in Computer Science, Addison-Wesley Publishing Group, 1979
4. [4] Krieger, Dalia Critical Exponents and Stabilizers of Infinite Words, Ph. D. Thesis, University of Waterloo, Waterloo, Ontario, Canada (2008) (http://uwspace.uwaterloo.ca/handle/10012/3599)
5. Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci [Representation of natural numbers as a sum of Fibonacci numbers];Lekkerkerker, Cornelis G.;Simon Stevin,1952