Number of prefixes in trace monoids: clique polynomials and dependency graphs

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

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 theoryMöbius functionsanalytic combinatoricsclique polynomialstrace monoidspatterns in words

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

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