We address the uniform random generation of words from a context-free language (over an
alphabet of size k), while constraining every letter to a targeted frequency of occurrence. Our …

Consider a class of decomposable combinatorial structures, using different types of atoms
Z={Z1,…, Z∣ Z∣}. We address the random generation of such structures with respect to a …

We present a large deviation property for pattern statistics representing the number of
occurrences of a symbol in words of given length generated at random according to a …

In this work, we study the problem of computing the coefficients of holonomic formal series in
two commuting variables. Given a formal series φ (x, y)=∑ n, k⩾ 0cnkxnyk specified by a …

We present some results concerning the rate functions of large deviations for symbol
statistics defined in primitive rational models. In our context these functions are always …

This paper addresses the uniform random generation of words from a context-free language
(over an alphabet of size k), while constraining every letter to a targeted frequency of …

We study the local limit distribution of the number of occurrences of a symbol in words of
length n generated at random in a regular language according to a rational stochastic …

The problem of computing the coefficients of formal power series (known as the Coefficient
Problem) is of primarly interest in many different areas such as combinatorics and theory of …

In this work we present a symbolic approach to computing with holonomic functions. More
precisely, given a function f (x) suspected to be holonomic, we show an algorithm which …

This paper addresses how to efficiently sample words from a rational language (over an
alphabet of size k), while constraining every letter to a targeted frequencies of occurrence …