D. and A. Jr, On a characterization of the nonregular set of primes, J. Comput. System Sci, vol.2, pp.464-467, 1968.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

I. Glaister and J. Shallit, Automaticity III: Polynomial automaticity and context-free languages, Computational Complexity, vol.7, issue.4, pp.371-387, 1998.
DOI : 10.1007/s000370050016
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.902

L. J. Guibas and A. M. Odlyzko, Periods in strings, Journal of Combinatorial Theory, Series A, vol.30, issue.1, pp.19-42, 1981.
DOI : 10.1016/0097-3165(81)90038-8

J. Hartmanis and H. Shank, On the Recognition of Primes by Automata, Journal of the ACM, vol.15, issue.3, pp.382-389, 1968.
DOI : 10.1145/321466.321470

C. Hsu, The Distribution of Irreducible Polynomials in Fq[t], Journal of Number Theory, vol.61, issue.1, pp.85-96, 1996.
DOI : 10.1006/jnth.1996.0139

R. M. Karp, Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines, Journal of the ACM, vol.14, issue.3, pp.478-489, 1967.
DOI : 10.1145/321406.321410

J. Kaneps and R. Freivalds, Minimal nontrivial space complexity of probabilistic one-way Turing machines, Proc. MFCS 1990, pp.355-361, 1990.

G. Lischke, Primitive words and roots of words, Acta Univ, pp.5-34, 2011.

M. Lothaire, Combinatorics on Words, 1983.
DOI : 10.1017/CBO9780511566097
URL : https://hal.archives-ouvertes.fr/hal-00620607

P. and T. Nielsen, A note on bifix-free sequences, IEEE Trans. Inform. Theory IT, pp.19-704, 1973.

N. Rampersad, J. Shallit, and M. Wang, Inverse star, borders, and palstars, Inverse star, borders, and palstars, pp.420-422, 2011.
DOI : 10.1016/j.ipl.2011.01.018
URL : http://arxiv.org/abs/1008.2440

M. Rigo, Syntactical and automatic properties of sets of polynomials over finite fields, Finite Fields Appl, pp.258-276, 2008.

M. Rigo and L. Waxweiler, Logical characterization of recognizable sets of polynomials over a finite field. To appear in Internat, J. Found. Comput. Sci

J. Shallit, Automaticity IV : sequences, sets, and diversity, Journal de Th??orie des Nombres de Bordeaux, vol.8, issue.2, pp.347-367, 1996.
DOI : 10.5802/jtnb.173

J. Shallit and Y. Breitbart, Automaticity I: Properties of a Measure of Descriptional Complexity, Journal of Computer and System Sciences, vol.53, issue.1, pp.10-25, 1996.
DOI : 10.1006/jcss.1996.0046

B. A. Trakhtenbrot, On an estimate for the weight of a finite tree, Sibirskii Matematicheskii Zhurnal, vol.5, pp.186-191, 1964.