In this work we prove that the Inclusion ProbÃ®em is decidable for a particular class of trace languages that is the class RFIN (Â£ , C) offinitely ambiguous rational trace languages over an alphabet Â£â€¦ (More)

In this work we study the complexity of certain counting functions related to forma1 power series in noncommuting variables. We prove that, for every algebraic formal power series in H((Z)), theâ€¦ (More)

â€” In this paper the class of Linearly Constrained Languages (LCL) is considered. A language L belongs to LCL iff il is the set of strings of a unambiguous context-free language L' that satisfy linearâ€¦ (More)

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 0 cnkxy specified by a holonomic system âˆ‘d1â€¦ (More)

We present a simple but efficient method for generating the set LPol(n) of L-convex polyominoes of size n. We show a bijection between LPol(n) and a suitable set of pairs of integer sequences. Thisâ€¦ (More)

Given a finite alphabet Î£ and a language L âŠ† Î£, the centralizer of L is defined as the maximal language commuting with it. We prove that if the primitive root of the smallest word of L (with respectâ€¦ (More)

We present an algorithm to compute the degree of convexity of a convex polyomino P , defined as the smallest integer k such that any two cells of P can be joined by a path in P with at most k changesâ€¦ (More)