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

DOI10.1007/978-3-030-51466-2_22MaRDI QIDQ2106610zbMATH OpenOpenAlexFDO

Authors Cyril Banderier, Massimiliano Goldwurm

Publication date 16 December 2022

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

zbMATH Keywords

analytic combinatoricsautomata theoryclique polynomialsMöbius functionspatterns in wordstrace monoids

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• SOME LIMIT DISTRIBUTIONS IN ANALYSIS OF ALGORITHMS FOR PROBLEMS ON TRACE LANGUAGES
• Probabilistic estimation of the number of prefixes of a trace
• scientific article; zbMATH DE number 4114058
• scientific article; zbMATH DE number 4058887
• Computing the average parallelism in trace monoids.

Cites work

• Analytic combinatorics
• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
• Analytic models and ambiguity of context-free languages
• Clique polynomials have a unique root of smallest modulus
• Combinatorial problems of commutation and rearrangements
• Dependence polynomials
• Determinants and Möbius functions in trace monoids
• Efficient recognition of trace languages defined by repeat-until loops
• Formulae and asymptotics for coefficients of algebraic functions
• scientific article; zbMATH DE number 3870628 (Why is no real title available?)
• scientific article; zbMATH DE number 4162275 (Why is no real title available?)
• scientific article; zbMATH DE number 4002104 (Why is no real title available?)
• scientific article; zbMATH DE number 4058887 (Why is no real title available?)
• scientific article; zbMATH DE number 3765179 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 4114058 (Why is no real title available?)
• Inhomogeneous sorting
• Möbius functions and confluent semi-commutations
• Probabilistic estimation of the number of prefixes of a trace
• 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)