References

• Chomsky, Noam, and Marcel-Paul Schützenberger. 1963. “The Algebraic Theory of Context-Free Languages.” In Computer Programming and Formal Systems, edited by P. Braffort and D. Hirschberg, vol. 35. Studies in Logic and the Foundations of Mathematics. Elsevier. https://doi.org/https://dx.doi.org/10.1016/s0049-237x(08)72023-8.
• Salomaa, Arto, and Marti Soittola. 1978. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer. https://doi.org/10.1007/978-1-4612-6264-0.
• Kuich, Werner, and Arto Salomaa. 1986. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science 5. Springer. https://doi.org/10.1007/978-3-642-69959-7.
• Flajolet, Philippe, and Robert Sedgewick. 2009. Analytic Combinatorics. Cambridge University Press.
• Kauers, Manuel, and Peter Paule. 2011. The Concrete Tetrahedron: Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates. 1st ed. Texts and Monographs in Symbolic Computation. Springer-Verlag Wien.
• Clemente, Lorenzo. 2020. “On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars.” In \Rm Proceedings 8th International Workshop on Verification and Program Transformation \Rm and 7th Workshop on Horn Clauses for Verification and Synthesis, \Rm Dublin, Ireland, 25-26th April 2020, edited by Laurent Fribourg and Matthias Heizmann, vol. 320. EPTCS. Open Publishing Association. https://doi.org/10.4204/EPTCS.320.2.