M. Tom and . Apostol, Introduction to analytic number theory, 1976.

J. Champarnaud, F. Ouardi, and D. Ziadi, An efficient computation of the equation k-automaton of a regular k-expression, pp.1-16, 2009.

R. Cox, Minimal number of edges in e-free non-deterministic finite automata (nfa) for regular expression (1 + ?) · (2 + ?) · (3 + ?) · · · (n + ?). The On-Line Encyclopedia of Integer Sequences

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

V. Geffert, Translation of binary regular expressions into nondeterministic ??-free automata with O(nlogn) transitions, Journal of Computer and System Sciences, vol.66, issue.3, pp.451-472, 2003.
DOI : 10.1016/S0022-0000(03)00036-9

C. Hagenah and A. Muscholl, Computing epsilon-free nfa from regular expressions in O(n log 2 (n)) time, pp.277-285, 1998.

J. E. Hopcroft, An n log n algorithm for minimizing states in a finite automaton In Theory of machines and computation, Pages 189-196, 1971.

J. Hromkovic, S. Seibert, and T. Wilke, Translating regular expressions into small epsilon-free nondeterministic finite automata, STACS '97: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, pp.55-66, 1997.

A. Khorsi, F. Ouardi, and D. Ziadi, Fast equation automaton computation, Journal of Discrete Algorithms, vol.6, issue.3, pp.433-448, 2008.
DOI : 10.1016/j.jda.2007.10.003
URL : http://doi.org/10.1016/j.jda.2007.10.003

S. Lombardy and J. Sakarovitch, The universal automaton, Logic and Automata, pp.457-504, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00620807

E. Moore, Gedanken-experiments on sequentiel machines, Automata studies, pp.129-153, 1956.
DOI : 10.1515/9781400882618-006

G. D. Harold, T. Paul, and . Bateman, A hundred years of prime numbers, Amer. Math. Monthly, vol.103, issue.9, p.729741, 1996.

G. Schnitger, Regular expressions and nfas without ?-transitions, STACS, pp.432-443, 2006.
DOI : 10.1007/11672142_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.8301

E. C. Titchmarsh, The theory of the Riemann zeta-function, 1986.

L. Yuri, A lower bound on the size of e-free nfa corresponding to a regular expression, Inf. Process. Lett, vol.85, issue.6, pp.293-299, 2003.

A. Asymptotic and . Following, we employ the standard asymptotic notation called Bachmann- Landau notation as follows. Let S be a set and s 0 ? S a particular element of S. We assume a notion of