×

Found 4 Documents (Results 1–4)

Enumerating regular expressions and their languages. (English) Zbl 1517.68190

Pin, Jean-Éric (ed.), Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 459-491 (2021).
MSC:  68Q45 05A16
PDFBibTeX XMLCite
Full Text: DOI arXiv

Analytic combinatorics of lattice paths with forbidden patterns: asymptotic aspects and Borges’s theorem. (English) Zbl 1482.05009

Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 10, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Recursive combinatorial structures: enumeration, probabilistic analysis and random generation. (English) Zbl 1487.68169

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 1, 5 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Full asymptotic expansion for Pólya structures. (English) Zbl 1409.05053

Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 12 p. (2016).
MSC:  05C05 05A16
PDFBibTeX XMLCite
Full Text: arXiv

Filter Results by …

Year of Publication

Main Field

Software