M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables, National Bureau of Standards Applied Mathematics Series, vol.55, 1964.

A. V. Aho, R. Sethi, and J. D. Ullman, Compilers, Principles, Techniques, 1986.

C. Akkan, A. Drexl, and A. Kimms, Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming, J. Log. Algebr. Program, vol.62, issue.1, pp.1-39, 2005.

E. A. Bender, L. B. Richmond, R. W. Robinson, and N. C. Wormald, The asymptotic number of acyclic digraphs, I. Combinatorica, vol.6, issue.1, pp.15-22, 1986.

E. A. Bender and R. W. Robinson, The asymptotic number of acyclic digraphs, II. J. Combin. Theory Ser. B, vol.44, issue.3, pp.363-369, 1988.

O. Bodini, M. Dien, A. Genitrini, and F. Peschanski, The ordered and colored products in analytic combinatorics: Application to the quantitative study of synchronizations in concurrent processes, Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, ANALCO'17, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01448695

O. Bodini, D. Gardy, and B. Gittenberger, Lambda terms of bounded unary height, Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, ANALCO '11, pp.23-32, 2011.

O. Bodini, D. Gardy, B. Gittenberger, and Z. Go??biewski, On the number of unarybinary tree-like structures with restrictions on the unary height, Ann. Comb, vol.22, issue.1, pp.45-91, 2018.

O. Bodini, D. Gardy, B. Gittenberger, and A. Jacquot, Enumeration of generalized BCI lambda-terms, Electr. J. Comb, vol.20, issue.4, p.30, 2013.

M. Bousquet-mélou, M. Lohrey, S. Maneth, and E. Noeth, XML compression via directed acyclic graphs, Theory of Computing Systems, vol.57, issue.4, pp.1322-1371, 2015.

V. Carnino and S. De-felice, Sampling different kinds of acyclic automata using Markov chains, Theoret. Comput. Sci, vol.450, pp.31-42, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00841870

, Release 1.0.13 of 2016-09-16

P. J. Downey, R. Sethi, and R. E. Tarjan, Variations on the common subexpression problem, J. Assoc. Comput. Mach, vol.27, issue.4, pp.758-771, 1980.

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

P. Flajolet, P. Sipala, and J. Steyaert, Analytic variations on the common subexpression problem, Automata, languages and programming, vol.443, pp.220-234, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075348

P. J. Grabner and B. Steinsky, Asymptotic behaviour of the poles of a special generating function for acyclic digraphs, Aequationes Math, vol.70, issue.3, pp.268-278, 2005.

P. Henrici, Special functions-integral transformsasymptotics-continued fractions, Reprint of the 1977 original, vol.2, 1991.

E. L. Ince, Ordinary Differential Equations, 1944.

M. Kauers and P. Paule, The Concrete Tetrahedron. Texts and Monographs in Symbolic Computation, 2011.

V. A. Liskovets, Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, vol.154, issue.3, pp.537-551, 2006.

C. Mcdiarmid, C. Semple, and D. Welsh, Counting phylogenetic networks, Ann. Comb, vol.19, issue.1, pp.205-224, 2015.

B. D. Mckay, On the shape of a random acyclic digraph, Math. Proc. Cambridge Philos. Soc, vol.106, issue.3, pp.459-465, 1989.

G. Melançon, I. Dutour, and M. Bousquet-mélou, Random generation of directed acyclic graphs, Comb01-Euroconference on Combinatorics, Graph Theory and Applications, vol.10, 2001.

G. Melançon and F. Philippe, Generating connected acyclic digraphs uniformly at random, Inform. Process. Lett, vol.90, issue.4, pp.209-213, 2004.

M. Mezzarobba, Autour de l'évaluation numérique des fonctions D-finies, 2011.

G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, vol.68, issue.1, pp.145-254, 1937.

D. Ralaivaosaona and S. Wagner, Repeated fringe subtrees in random rooted trees, Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp.78-88, 2015.

R. W. Robinson, Enumeration of acyclic digraphs, Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications, pp.391-399, 1970.

R. W. Robinson, Counting labeled acyclic digraphs, New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, pp.239-273, 1971.

R. W. Robinson, Counting unlabeled acyclic digraphs, Combinatorial Mathematics, V (Proc. Fifth Austral. Conf, vol.622, pp.28-43, 1976.

L. Schlesinger, Handbuch der Theorie der linearen Differentialgleichungen. In zwei Bänden, Band I. Reprint. Bibliotheca Mathematica Teubneriana, Band 30, Johnson Reprint Corp, 1968.

R. P. Stanley, With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin, Cambridge Studies in Advanced Mathematics, vol.2, 1999.

B. Steinsky, Enumeration of labelled chain graphs and labelled essential directed acyclic graphs, Discrete Math, vol.270, issue.1-3, pp.267-278, 2003.

B. Steinsky, Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs, Graphs Combin, vol.20, issue.3, pp.399-411, 2004.

S. Wagner, Asymptotic enumeration of extensional acyclic digraphs, Algorithmica, vol.66, issue.4, pp.829-847, 2013.

M. Wallner, A bijection of plane increasing trees with relaxed binary trees of right height at most one, Theoretical Computer Science, vol.755, pp.1-12, 2019.

W. Wasow, Asymptotic Expansions for Ordinary Differential Equations, 1987.