Publication:2106610

DOI10.1007/978-3-030-51466-2_22OpenAlexW3037397897MaRDI QIDQ2106610FDOQ2106610

Massimiliano Goldwurm, Cyril Banderier

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_22

zbMATH Keywords

automata theoryclique polynomialstrace monoidsanalytic combinatorics[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius+functions&go=Go M��bius functions]patterns in words

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dependence polynomials
• Determinants and Möbius functions in trace monoids
• Combinatorial problems of commutation and rearrangements
• Clique polynomials have a unique root of smallest modulus
• Möbius functions and confluent semi-commutations
• Analytic models and ambiguity of context-free languages
• Inhomogeneous sorting
• Formulae and Asymptotics for Coefficients of Algebraic Functions
• Efficient recognition of trace languages defined by repeat-until loops
• Probabilistic estimation of the number of prefixes of a trace
• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
• SOME LIMIT DISTRIBUTIONS IN ANALYSIS OF ALGORITHMS FOR PROBLEMS ON TRACE LANGUAGES

This page was built for publication: Number of prefixes in trace monoids: clique polynomials and dependency graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106610)